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.


    Zugriff

    Download


    Exportieren, teilen und zitieren



    Titel :

    Planning cooperative motions of cognitive automobiles using tree search algorithms


    Beteiligte:
    Frese, C. (Autor:in) / Beyerer, J. (Autor:in)

    Kongress:

    2010


    Erscheinungsdatum :

    2010


    Format / Umfang :

    8 pages


    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    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