Safe and reliable navigation in crowded unstructured pedestrian areas

In this paper, the navigation system of the autonomous vehicle prototype Verdino is introduced. Two navigation levels are considered. In the first level, a trajectory is generated from the current position toward a goal that considers two different approaches. In the first, the minimum cost path is obtained using a classical approach (used for regular navigation). The second approach is a little more complex, relying on a set of precomputed primitives representing the motion model of the vehicle, which are used as part of an ARA* algorithm in order to find the best trajectory. This trajectory consists of both forward and backward motion segments for complex maneuvers. In the second level, a local planner is in charge of computing the commands sent to the vehicle in order to follow the trajectory. A set of tentative local trajectories is computed in the Frenet space and scored using several factors, described in this paper. Some results for the two navigation levels are shown at the end of this document. For the global planner, several examples of the maneuvers obtained are shown and certain related factors are quantified and compared. As for the local planner, a study on the influence of the defined weights on the vehicle's final behavior is presented. Also, from these tests several configurations have been chosen and ranked according to two different proposed behaviors. The navigation system shown has been tested both in simulated and in real conditions, and the attached video shows the vehicle's real-world performance. Graphical abstractDisplay Omitted HighlightsA navigation system has been developed for an autonomous vehicle.The autonomous vehicle can navigate along unstructured and crowded environments.Two planning levels are used, considering two approaches for the first one.The system has been successfully tested in real conditions, results shown.

[1]  Antonio Morell,et al.  MCL with sensor fusion based on a weighting mechanism versus a particle generation approach , 2013, 16th International IEEE Conference on Intelligent Transportation Systems (ITSC 2013).

[2]  William D. Smart,et al.  Layered costmaps for context-sensitive navigation , 2014, 2014 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[3]  S. LaValle,et al.  Randomized Kinodynamic Planning , 2001 .

[4]  Dirk Haehnel,et al.  Junior: The Stanford entry in the Urban Challenge , 2008 .

[5]  Daniel Alonso,et al.  Path planning approach based on flock dynamics of moving particles , 2013, Appl. Soft Comput..

[6]  Jonathan P. How,et al.  Real-Time Motion Planning With Applications to Autonomous Urban Driving , 2009, IEEE Transactions on Control Systems Technology.

[7]  Nancy M. Amato,et al.  Randomized motion planning for car-like robots with C-PRM , 2001, Proceedings 2001 IEEE/RSJ International Conference on Intelligent Robots and Systems. Expanding the Societal Role of Robotics in the the Next Millennium (Cat. No.01CH37180).

[8]  Ross A. Knepper,et al.  High Performance State Lattice Planning Using Heuristic Look-Up Tables , 2006, 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[9]  Maxim Likhachev,et al.  Motion planning in urban environments , 2008 .

[10]  R. Murray,et al.  Real‐time trajectory generation for differentially flat systems , 1998 .

[11]  Sanjiv Singh,et al.  The DARPA Urban Challenge: Autonomous Vehicles in City Traffic, George Air Force Base, Victorville, California, USA , 2009, The DARPA Urban Challenge.

[12]  Myoungho Sunwoo,et al.  Local Path Planning for Off-Road Autonomous Driving With Avoidance of Static Obstacles , 2012, IEEE Transactions on Intelligent Transportation Systems.

[13]  Sanjiv Singh,et al.  The 2005 DARPA Grand Challenge: The Great Robot Race , 2007 .

[14]  Christopher M. Clark,et al.  Motion planning for formations of mobile robots , 2004, Robotics Auton. Syst..

[15]  Sanjiv Singh,et al.  The 2005 DARPA Grand Challenge , 2007 .

[16]  Wolfram Burgard,et al.  Improved Techniques for Grid Mapping With Rao-Blackwellized Particle Filters , 2007, IEEE Transactions on Robotics.

[17]  Roland Siegwart,et al.  Smooth and efficient obstacle avoidance for a tour guide robot , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).

[18]  Sebastian Thrun,et al.  Stanley: The robot that won the DARPA Grand Challenge , 2006, J. Field Robotics.

[19]  Oliver Brock,et al.  High-speed navigation using the global dynamic window approach , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[20]  Maxim Likhachev,et al.  Planning Long Dynamically Feasible Maneuvers for Autonomous Vehicles , 2008, Int. J. Robotics Res..

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

[22]  Julius Ziegler,et al.  Optimal trajectory generation for dynamic street scenarios in a Frenét Frame , 2010, 2010 IEEE International Conference on Robotics and Automation.

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