Constraint-Aware Navigation in Dynamic Environments

Path planning is a fundamental problem in many areas ranging from robotics and artificial intelligence to computer graphics and animation. While there is extensive literature for computing optimal, collision-free paths, there is little work that explores the satisfaction of spatial constraints between objects and agents at the global navigation layer. This paper presents a planning framework that satisfies multiple spatial constraints imposed on the path. The type of constraints specified could include staying behind a building, walking along walls, or avoiding the line of sight of patrolling agents. We introduce a hybrid environment representation that balances computational efficiency and discretization resolution, to provide a minimal, yet sufficient discretization of the search graph for constraint-aware navigation. An extended anytime-dynamic planner is used to compute constraint-aware paths, while efficiently repairing solutions to account for dynamic constraints. We demonstrate the benefits of our method on challenging navigation problems in complex environments for dynamic agents using combinations of hard and soft constraints, attracting and repelling constraints, on static obstacles and moving obstacles.

[1]  Charles W. Warren,et al.  Global path planning using artificial potential fields , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[2]  Glenn Reinman,et al.  A modular framework for adaptive agent-based steering , 2011, SI3D.

[3]  Adrien Treuille,et al.  Continuum crowds , 2006, SIGGRAPH 2006.

[4]  Subhrajit Bhattacharya,et al.  Search-Based Path Planning with Homotopy Class Constraints in 3D , 2010, AAAI.

[5]  Glenn Reinman,et al.  Parallelized egocentric fields for autonomous navigation , 2012, The Visual Computer.

[6]  Norman I. Badler,et al.  Controlling individual agents in high-density crowd simulation , 2007, SCA '07.

[7]  Ray A. Jarvis,et al.  Robotic covert path planning: A survey , 2011, 2011 IEEE 5th International Conference on Robotics, Automation and Mechatronics (RAM).

[8]  Norman I. Badler,et al.  Algorithms for generating motion trajectories described by prepositions , 2000, Proceedings Computer Animation 2000.

[9]  Maxim Likhachev,et al.  D*lite , 2002, AAAI/IAAI.

[10]  Craig W. Reynolds.  Steering Behaviors For Autonomous Characters , 1999 .

[11]  Marcelo Kallmann.  Shortest paths with arbitrary clearance from navigation meshes , 2010, SCA '10.

[12]  Roland Geraerts,et al.  Planning short paths with clearance using explicit corridors , 2010, 2010 IEEE International Conference on Robotics and Automation.

[13]  Thomas Rist,et al.  Characterizing Trajectories of Moving Objects Using Natural Language Path Descriptions , 2003 .

[14]  Yoji Kuroda,et al.  Potential Field Navigation of High Speed Unmanned Ground Vehicles on Uneven Terrain , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.

[15]  Charles W. Warren,et al.  Multiple robot path coordination using artificial potential fields , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

[16]  Leonidas J. Guibas,et al.  Scalable nonlinear dynamical systems for agent steering and crowd simulation , 2001, Comput. Graph..

[17]  Ronald C. Arkin,et al.  Motor schema based navigation for a mobile robot: An approach to programming by behavior , 1987, Proceedings. 1987 IEEE International Conference on Robotics and Automation.

[18]  RaphaelBertram,et al.  Correction to "A Formal Basis for the Heuristic Determination of Minimum Cost Paths" , 1972 .

[19]  Vijay Kumar,et al.  Topological constraints in search-based robot path planning , 2012, Auton. Robots.

[20]  Norman I. Badler,et al.  Multi-domain real-time planning in dynamic environments , 2013, SCA '13.

[21]  Rina Dechter,et al.  Generalized best-first search strategies and the optimality of A* , 1985, JACM.

[22]  Helbing,et al.  Social force model for pedestrian dynamics. , 1995, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

[23]  Mubbasir Kapadia,et al.  Navigation and steering for autonomous virtual humans. , 2013, Wiley interdisciplinary reviews. Cognitive science.

[24]  Norman I. Badler,et al.  Virtual Crowds: Methods, Simulation, and Control , 2008, Virtual Crowds: Methods, Simulation, and Control.

[25]  Petros Faloutsos,et al.  Situation agents: agent‐based externalized steering logic , 2010, Comput. Animat. Virtual Worlds.

[26]  Glenn Reinman,et al.  Footstep navigation for dynamic crowds , 2011, SI3D.

[27]  Sebastian Thrun,et al.  Anytime Dynamic A*: An Anytime, Replanning Algorithm , 2005, ICAPS.

[28]  Petros Faloutsos,et al.  Egocentric affordance fields in pedestrian steering , 2009, I3D '09.

[29]  Norman I. Badler,et al.  Virtual Crowds: Methods, Simulation, and Control (Synthesis Lectures on Computer Graphics and Animation) , 2008 .

[30]  Nathan R. Sturtevant,et al.  Benchmarks for Grid-Based Pathfinding , 2012, IEEE Transactions on Computational Intelligence and AI in Games.

[31]  Sebastian Thrun,et al.  ARA*: Anytime A* with Provable Bounds on Sub-Optimality , 2003, NIPS.

[32]  Pere Ridao,et al.  Path planning with homotopy class constraints on bathymetric maps , 2011, OCEANS 2011 IEEE - Spain.

[33]  Dinesh Manocha,et al.  Reciprocal Velocity Obstacles for real-time multi-agent navigation , 2008, 2008 IEEE International Conference on Robotics and Automation.

[34]  Nathan R. Sturtevant.  Incorporating Human Relationships Into Path Planning , 2013, AIIDE.

[35]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[36]  Sébastien Paris,et al.  Pedestrian Reactive Navigation for Crowd Simulation: a Predictive Approach , 2007, Comput. Graph. Forum.

[37]  Dominik Schultes.  Route Planning in Road Networks , 2008, Ausgezeichnete Informatikdissertationen.