Let's Collaborate: Regret-based Reactive Synthesis for Robotic Manipulation

M. Zinkevich, M. Johanson, M. Bowling, and C. Piccione, “Regret minimization in games with incomplete information,” Advances in neural information processing systems , vol. 20, pp. 1729–1736, 2007

2007

Earlier work this paper cites.

H. Kress-Gazit, G. E. Fainekos, and G. J. Pappas, “Temporal-logic-based reactive mission and motion planning,” IEEE Transactions on Robotics , vol. 25, no. 6, pp. 1370–1381, 2009

2009

Earlier work this paper cites.

E. Filiot, T. Le Gall, and J.-F. Raskin, “Iterated regret minimization in game graphs,” in International Symposium on Mathematical Foundations of Computer Science . Springer, 2010, pp. 342–354

2010

Earlier work this paper cites.

J. Y. Halpern and R. Pass, “Iterated regret minimization: A new solution concept,” Games and Economic Behavior , vol. 74, no. 1, pp. 184–207, 2012

2012

Earlier work this paper cites.

E. M. Wolff, U. Topcu, and R. M. Murray, “Efficient reactive controller synthesis for a fragment of linear temporal logic,” in 2013 IEEE International Conference on Robotics and Automation , 2013, pp. 5033–5040

2013

Earlier work this paper cites.

G. De Giacomo and M. Y. Vardi, “Linear temporal logic and linear dynamic logic on finite traces,” in Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence , ser. IJCAI ’13. AAAI Press, 2013, p. 854–860

2013

Earlier work this paper cites.

C. I. Vasile and C. Belta, “Reactive sampling-based temporal logic path planning,” in 2014 IEEE International Conference on Robotics and Automation (ICRA) , 2014, pp. 4310–4315

2014

Earlier work this paper cites.

K. He, M. Lahijanian, L. E. Kavraki, and M. Y. Vardi, “Towards manipulation planning with temporal logic specifications,” in IEEE international conference on robotics and automation . IEEE, 2015, pp. 346–352

2015

Cited alongside, same era.

——, “Minimizing regret in discounted-sum games,” arXiv preprint arXiv:1511.00523 , 2015

Original

2015

Cited alongside, same era.

——, “Reactive synthesis for finite tasks under resource constraints,” in IEEE/RSJ International Conference on Intelligent Robots and Systems . IEEE, 2017, pp. 5326–5332

2017

Cited alongside, same era.

M. G. Azar, I. Osband, and R. Munos, “Minimax regret bounds for reinforcement learning,” in International Conference on Machine Learning . PMLR, 2017, pp. 263–272

2017

Cited alongside, same era.

P. Hunter, G. A. Pérez, and J.-F. Raskin, “Reactive synthesis without regret,” Acta informatica , vol. 54, no. 1, pp. 3–39, 2017

——, “Automated abstraction of manipulation domains for cost-based reactive synthesis,” IEEE Robotics and Automation Letters , vol. 4, no. 2, pp. 285–292, 2019

2019

Later among the works it cites.

P. Haslum, N. Lipovetzky, D. Magazzeni, and C. Muise, An Introduction to the Planning Domain Definition Language . Morgan & Claypool, 2019

2019

Later among the works it cites.

A. M. Wells, Z. Kingston, M. Lahijanian, L. E. Kavraki, and M. Y. Vardi, “Finite-horizon synthesis for probabilistic manipulation domains,” in IEEE International Conference on Robotics and Automation . IEEE, 2021, (to appear)

2021

Later among the works it cites.

L. Chen, H. Luo, and C.-Y. Wei, “Minimax regret for stochastic shortest path with adversarial costs and known transition,” in Conference on Learning Theory . PMLR, 2021, pp. 1180–1215

2021

Later among the works it cites.

L. Chen and H. Luo, “Finding the stochastic shortest path with low regret: The adversarial cost and unknown transition case,” arXiv preprint arXiv:2102.05284 , 2021