Rüdiger Dillmann, Jürgen Beyerer, Uwe D. Hanebeck, Tanja Schultz (Hrsg.), KI 2010: Advances in Artificial Intelligence, Lecture Notes in Artificial Intelligence, Bd. 6359, Springer, 2010.
KI 2010 - 33rd Annual German Conference on Artificial Intelligence, Karlsruhe, 21.-24. September 2010
A tree search algorithm is proposed for planning cooperative motions of multiple vehicles. The method relies on planning techniques from artificial intelligence such as A* search and cost-to-go estimation. It avoids the restrictions of decoupling assumptions and exploits the full potential of cooperative actions. Precomputation of lower bounds is used to restrict the search to a small portion of the tree of possible cooperative actions. The proposed algorithm is applied to the problem of planning cooperative maneuvers for multiple cognitive vehicles with the aim of preventing accidents in dangerous traffic situations. Simulation results show the feasibility of the approach and the performance gain obtained by precomputing lower bounds.