ABSTRACT
Autonomous agents such as self-driving cars or parcel robots need to recognize and avoid possible collisions with obstacles in order to move successfully in their environment. Humans, however, have learned to predict movements intuitively and to avoid obstacles in a forward-looking way. The task of collision avoidance can be divided into a global and a local level. Regarding the global level, we propose an approach called "Predictive Collision Management Path Planning" (PCMP). At the local level, solutions for collision avoidance are used that prevent an inevitable collision. Therefore, the aim of PCMP is to avoid unnecessary local collision scenarios using predictive collision management. PCMP is a graph-based algorithm with a focus on the time dimension consisting of three parts: (1) movement prediction, (2) integration of movement prediction into a time-dependent graph, and (3) time and risk-dependent path planning. The algorithm combines the search for a shortest path with the question: is the detour worth avoiding a possible collision scenario? We evaluate the evasion behavior and the results show that a risk-sensitive agent can avoid 47.3% of the collision scenarios while making a detour of 1.3%. A risk-averse agent avoids up to 97.3% of the collision scenarios with a detour of 39.1%. Thus, an agent's evasive behavior can be controlled actively and risk-dependent using PCMP.
- A. Alahi, K. Goel, V. Ramanathan, A. Robicquet, L. Fei-Fei, and S. Savarese. 2016. Social LSTM: Human Trajectory Prediction in Crowded Spaces. In 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR).Google Scholar
- Samer Ammoun and Fawzi Nashashibi. 2009. Real time trajectory prediction for collision risk estimation between vehicles. In ICCP 2009.Google ScholarCross Ref
- C. Barrios and Yuichi Motai. 2011. Improving Estimation of Vehicle's Trajectory Using the Latest Global Positioning System With Kalman Filtering. IEEE T. Instrumentation and Measurement 60 (12 2011), 3747--3755.Google Scholar
- A. Eidehall and L. Petersson. 2008. Statistical Threat Assessment for General Road Scenes Using Monte Carlo Sampling. IEEE Transactions on Intelligent Transportation Systems 9, 1 (March 2008), 137--147. Google ScholarDigital Library
- C. Fulgenzi, A. Spalanzani, C. Laugier, and C. Tay. 2010. Risk based motion planning and navigation in uncertain dynamic environment. Research Report.Google Scholar
- T. Gindele, S. Brechtel, and R. Dillmann. 2015. Learning Driver Behavior Models from Traffic Observations for Decision Making and Planning. IEEE Intelligent Transportation Systems Magazine 7, 1 (Spring 2015), 69--79.Google ScholarCross Ref
- Nico Kaempchen, K. Weiss, M. Schaefer, and K.C.J. Dietmayer. 2004. IMM object tracking for high dynamic driving maneuvers. 825--830.Google Scholar
- O. Khatib. 1985. Real-time obstacle avoidance for manipulators and mobile robots. In Proceedings. 1985 IEEE Intl Conference on Robotics and Automation, Vol. 2.Google ScholarCross Ref
- B. Kim, C. Kang, J. Kim, S. Lee, C. Chung, and J. Choi. 2017. Probabilistic vehicle trajectory prediction over occupancy grid map via recurrent neural network. In 2017 IEEE 20th Intl Conference on Intelligent Transportation Systems (ITSC).Google Scholar
- A. Kushleyev and M. Likhachev. 2009. Time-bounded lattice for efficient planning in dynamic environments. In 2009 IEEE Intl Conf. on Robotics and Automation. Google ScholarDigital Library
- S. LaValle. 1998. Rapidly-exploring random trees: a new tool for path planning.Google Scholar
- S. Lefevre, D. Vasquez, and C. Laugier. 2014. A survey on motion prediction and risk assessment for intelligent vehicles. Robomech Journal 1 (07 2014).Google Scholar
- Seong Park, ByeongDo Kim, Chang Kang, Chung Chung, and Jun Choi. 2018. Sequence-to-Sequence Prediction of Vehicle Trajectory via LSTM Encoder-Decoder Architecture. 1672--1678. https://doi.org/10.1109/IVS.2018.8500658Google Scholar
- Roland Philippsen, Björn Jensen, and Roland Siegwart. 2006. Toward Online Probabilistic Path Replanning in Dynamic Environments. 2876--2881.Google Scholar
- David Silver. 2005. Cooperative Pathfinding. (01 2005). http://www0.cs.ucl.ac.uk/staff/d.silver/web/Publications_files/coop-path-AIWisdom.pdfGoogle Scholar
- Q. Tran and J. Firl. 2014. Online maneuver recognition and multimodal trajectory prediction for intersection assistance using non-parametric regression. In 2014 IEEE Intelligent Vehicles Symposium Proceedings. 918--923.Google Scholar
- J. van den Berg, D. Ferguson, and J. Kuffner. 2006. Anytime path planning and replanning in dynamic environments. In Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006. 2366--2371.Google Scholar
- Pu Zhang, Wanli Ouyang, Pengfei Zhang, Jianru Xue, and Nanning Zheng. 2019. SR-LSTM: State Refinement for LSTM towards Pedestrian Trajectory Prediction. arXiv:1903.02793 [cs.CV]Google Scholar
- Liang Zhao, Tatsuya Ohshima, and Hiroshi Nagamochi. 2008. A* Algorithm for the time-dependent shortest path problem. (01 2008).Google Scholar
Index Terms
- Predictive Collision Management for Time and Risk Dependent Path Planning
Recommendations
Reactive path planning in a dynamic environment
This paper deals with the problem of path planning in a dynamic environment, where the workspace is cluttered with unpredictably moving objects. The concept of the virtual plane is introduced and used to create reactive kinematic-based navigation laws. ...
Collision free path-planning for cable-driven parallel robots
In this study, a path-planning method that has been developed for serial manipulators is adapted to cable-driven robots. The proposed method has two modes. The first one is active when the robot is far from an obstacle. In this mode, the robot moves ...
On-line Planning for Collision Avoidance on the Nominal Path
In this paper a solution to the obstacle avoidance problem for a mobile robot moving in the two-dimensional Cartesian plane is presented. The robot is modelled as a linear time-invariant dynamic system of finite size enclosed by a circle and the obstacles ...
Comments