Abstract
This paper presents an algorithm for autonomous online path planning in uncertain, possibly adversarial, and partially observable environments. In contrast to many state-of-the-art motion planning approaches, our focus is on decision making in the presence of adversarial agents who may be acting strategically but whose exact behaviour is difficult to model precisely. Our algorithm first computes a collection of reachable sets with respect to a family of possible strategies available to the adversary. Online, the agent uses these sets as composable behavioural templates, in conjunction with a particle filter to maintain the current belief on the adversary’s strategy. In partially observable environments, this yields significant performance improvements over state-of-the-art planning algorithms. We present empirical results to this effect using a robotic soccer simulator, highlighting the applicability of our implementation against adversaries with varying capabilities. We also demonstrate experiments on the NAO humanoid robots, in the context of different collision-avoidance scenarios.
Chapter PDF
Similar content being viewed by others
References
Supporting material, http://www.youtube.com/watch?v=BfJgWz4TwlE
NAO robot documentation, http://academics.aldebaran-robotics.com/
RoboCup SPL rules, pp. 1–27 (2010), http://www.tzi.de/spl/
van den Berg, J., Guy, S.J., Lin, M., Manocha, D.: Reciprocal n-body collision avoidance. In: Pradalier, C., Siegwart, R., Hirzinger, G. (eds.) Robotics Research. STAR, vol. 70, pp. 3–19. Springer, Heidelberg (2011)
Bruce, J.: Real-Time Motion Planning and Safe Navigation in Dynamic Multi-Robot Environments. Ph.D. thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA (January 2006)
Burridge, R.R., Rizzi, A.A., Koditschek, D.E.: Sequential composition of dynamically dexterous robot behaviors. IJRR 18(6), 534–555 (1999)
Ding, J., Tomlin, C.J.: Trajectory optimization in convex underapproximations of safe regions. In: CDC, pp. 2510–2515 (2009)
Fiorini, P., Shillert, Z.: Motion planning in dynamic environments using velocity obstacles. International Journal of Robotics Research 17, 760–772 (1998)
Fox, D., Burgard, W., Thrun, S.: The dynamic window approach to collision avoidance. IEEE RAM 4(1), 23–33 (1997)
Gordon, N.J., Salmond, D.J., Smith, A.F.M.: Novel approach to nonlinear/non-gaussian bayesian state estimation. Radar and Signal Processing 140(2), 107–113 (1993)
Mitchell, I.M., Templeton, J.A.: A Toolbox of Hamilton-Jacobi Solvers for Analysis of Nondeterministic Continuous and Hybrid Systems. In: Morari, M., Thiele, L. (eds.) HSCC 2005. LNCS, vol. 3414, pp. 480–494. Springer, Heidelberg (2005)
Rimon, E., Koditschek, D.E.: Exact robot navigation using artificial potential functions. IEEE Trans. Rob. Aut. 8, 501–518 (1992)
Tedrake, R.: LQR-trees: Feedback motion planning on sparse randomized trees. In: Proceedings of Robotics: Science and Systems, Seattle, USA (June 2009)
Tomlin, C.J., Lygeros, J., Sastry, S.S.: A game theoretic approach to controller design for hybrid systems. Proc. IEEE, 949–970 (2000)
Tomlin, C.J., Mitchell, I., Bayen, A.M., Oishi, M.: Computational techniques for the verification of hybrid systems. Proc. IEEE, 986–1001 (2003)
Varaiya, P.: Hierarchical control of semi-autonomous teams under uncertainty. Final report of Darpa Contract F33615-01-C-3150 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Valtazanos, A., Ramamoorthy, S. (2012). Online Motion Planning for Multi-robot Interaction Using Composable Reachable Sets. In: Röfer, T., Mayer, N.M., Savage, J., Saranlı, U. (eds) RoboCup 2011: Robot Soccer World Cup XV. RoboCup 2011. Lecture Notes in Computer Science(), vol 7416. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32060-6_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-32060-6_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32059-0
Online ISBN: 978-3-642-32060-6
eBook Packages: Computer ScienceComputer Science (R0)