Stochastic Games for Interactive Manipulation Domains (2403.04910v1)
Abstract: As robots become more prevalent, the complexity of robot-robot, robot-human, and robot-environment interactions increases. In these interactions, a robot needs to consider not only the effects of its own actions, but also the effects of other agents' actions and the possible interactions between agents. Previous works have considered reactive synthesis, where the human/environment is modeled as a deterministic, adversarial agent; as well as probabilistic synthesis, where the human/environment is modeled via a Markov chain. While they provide strong theoretical frameworks, there are still many aspects of human-robot interaction that cannot be fully expressed and many assumptions that must be made in each model. In this work, we propose stochastic games as a general model for human-robot interaction, which subsumes the expressivity of all previous representations. In addition, it allows us to make fewer modeling assumptions and leads to more natural and powerful models of interaction. We introduce the semantics of this abstraction and show how existing tools can be utilized to synthesize strategies to achieve complex tasks with guarantees. Further, we discuss the current computational limitations and improve the scalability by two orders of magnitude by a new way of constructing models for PRISM-games.
- H. Kress-Gazit, G. Fainekos, and G. J. Pappas, “Where’s waldo? sensor-based temporal logic motion planning,” in Int. Conf. on Robotics and Automation. Rome, Italy: IEEE, 2007, pp. 3116–3121.
- H. Kress-Gazit, M. Lahijanian, and V. Raman, “Synthesis for robots: Guarantees and feedback for robot behavior,” Annual Review of Control, Robotics, and Autonomous Systems, vol. 1, no. 1, pp. 211–236, 2018.
- K. He, A. M. Wells, L. E. Kavraki, and M. Y. Vardi, “Efficient symbolic reactive synthesis for finite-horizon tasks,” in 2019 Intl. Conf. on Robotics and Automation (ICRA). IEEE, 2019, pp. 8993–8999.
- S. Junges, N. Jansen, J.-P. Katoen, and U. Topcu, “Probabilistic model checking for complex cognitive tasks–a case study in human-robot interaction,” arXiv preprint arXiv:1610.09409, 2016.
- A. M. Wells, Z. Kingston, M. Lahijanian, L. E. Kavraki, and M. Y. Vardi, “Finite horizon synthesis for probabilistic manipulation domains,” in Intl. Conf. on Robotics and Automation. IEEE, 2021.
- A. Abate, J. Gutierrez, L. Hammond, P. Harrenstein, M. Kwiatkowska, M. Najib, G. Perelli, T. Steeples, and M. Wooldridge, “Rational verification: game-theoretic verification of multi-agent systems,” Applied Intelligence, vol. 51, pp. 6569–6584, 2021.
- K. He, M. Lahijanian, L. E. Kavraki, and M. Y. Vardi, “Reactive synthesis for finite tasks under resource constraints,” in Int. Conf. on Intelligent Robots and Systems (IROS). Vancouver, BC, Canada: IEEE, 2017, pp. 5326–5332.
- M. Kwiatkowska, G. Norman, D. Parker, and G. Santos, “PRISM-games 3.0: Stochastic game verification with concurrency, equilibria and time,” in Proc. 32nd International Conference on Computer Aided Verification (CAV’20), ser. LNCS, vol. 12225. Springer, 2020, pp. 475–487.
- A. M. Wells, “Stochastic games for robotics.” [Online]. Available: https://github.com/andrewmw94/stochastic_games_for_robotics_code
- A. Pnueli, “The temporal logic of programs,” in Foundations of Computer Science, 1977., 18th Annual Symposium on. IEEE, 1977, pp. 46–57.
- G. De Giacomo and M. Y. Vardi, “Linear temporal logic and linear dynamic logic on finite traces.” in Intl. Joint Conf. on Artificial Intelligence (IJCAI), vol. 13, 2013, pp. 854–860.
- S. Zhu, L. M. Tabajara, J. Li, G. Pu, and M. Y. Vardi, “Symbolic LTLf synthesis,” in Proc. of the 26th Intl. Joint Conf. on Artificial Intelligence. AAAI Press, 2017, pp. 1362–1369.
- T. Wongpiromsarn, U. Topcu, and R. M. Murray, “Receding horizon temporal logic planning,” IEEE Transactions on Automatic Control, vol. 57, no. 11, pp. 2817–2830, 2012.
- C. I. Vasile and C. Belta, “Reactive sampling-based temporal logic path planning,” in Intl. Conf. on Robotics and Automation (ICRA). IEEE, 2014, pp. 4310–4315.
- E. M. Wolff, U. Topcu, and R. M. Murray, “Efficient reactive controller synthesis for a fragment of linear temporal logic,” in Intl. Conf. on Robotics and Automation (ICRA). IEEE, 2013, pp. 5033–5040.
- K. He, M. Lahijanian, L. E. Kavraki, and M. Y. Vardi, “Automated abstraction of manipulation domains for cost-based reactive synthesis,” IEEE Robotics and Automation Letters, vol. 4, no. 2, pp. 285–292, 2018.
- K. Muvvala, P. Amorese, and M. Lahijanian, “Let’s collaborate: Regret-based reactive synthesis for robotic manipulation,” in Int. Conf. on Robotics and Automation. IEEE, 2022, pp. 4340–4346.
- M. Kwiatkowska, G. Norman, and D. Parker, “PRISM 4.0: Verification of probabilistic real-time systems,” in Proc. 23rd Intl. Conf. on Computer Aided Verification (CAV’11), ser. LNCS, vol. 6806. Springer, 2011, pp. 585–591.
- F. Miao, Q. Zhu, M. Pajic, and G. J. Pappas, “A hybrid stochastic game for secure control of cyber-physical systems,” Automatica, vol. 93, pp. 55–63, 2018.
- L. Feng, C. Wiltsche, L. Humphrey, and U. Topcu, “Controller synthesis for autonomous systems interacting with human operators,” in Proceedings of the ACM/IEEE Sixth International Conference on Cyber-Physical Systems, ser. ICCPS ’15. New York, NY, USA: Association for Computing Machinery, 2015, p. 70–79.
- A. M. Wells, M. Lahijanian, L. E. Kavraki, and M. Y. Vardi, “LTLf synthesis on probabilistic systems (online version).”
- A. K. Bozkurt, Y. Wang, M. M. Zavlanos, and M. Pajic, “Model-free reinforcement learning for stochastic games with linear temporal logic objectives,” in 2021 IEEE International Conference on Robotics and Automation (ICRA), 2021, pp. 10 649–10 655.
- G. De Giacomo and M. Y. Vardi, “Synthesis for LTL and LDL on finite traces,” in Intl. Joint Conf. on Artificial Intelligence (IJCAI), vol. 15, 2015, pp. 1558–1564.
- M. Kwiatkowska, G. Norman, D. Parker, and G. Santos, “Automatic verification of concurrent stochastic systems,” Formal Methods in System Design, vol. 58, no. 1-2, pp. 188–250, 2021.
- A. Condon, “The complexity of stochastic games,” Information and Computation, vol. 96, no. 2, pp. 203–224, 1992.
- K. Muvvala and M. Lahijanian, “Efficient symbolic approaches for quantitative reactive synthesis with finite tasks,” in 2023 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), 2023, pp. 8666–8672.
- A. Condon, “On algorithms for simple stochastic games,” in Advances in Computational Complexity Theory, volume 13 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, 1993, pp. 51–73.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.