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.


    Access

    Download


    Export, share and cite



    Title :

    Planning cooperative motions of cognitive automobiles using tree search algorithms


    Contributors:
    Frese, C. (author) / Beyerer, J. (author)

    Conference:

    2010


    Publication date :

    2010


    Size :

    8 pages


    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English




    Cooperative Cognitive Automobiles

    Stiller, C. / Farber, G. / Kammel, S. et al. | British Library Conference Proceedings | 2007


    Cooperative Cognitive Automobiles

    Stiller, C. / Färber, G. / Kammel, S. | DataCite | 2007


    Cooperative Cognitive Automobiles

    Stiller, Christoph / Farber, Georg / Kammel, Soren | IEEE | 2007