A computer program automatically generates plans for a group of robotic vehicles (rovers) engaged in geological exploration of terrain. The program rapidly generates multiple command sequences that can be executed simultaneously by the rovers. Starting from a set of high-level goals, the program creates a sequence of commands for each rover while respecting hardware constraints and limitations on resources of each rover and of hardware (e.g., a radio communication terminal) shared by all the rovers. First, a separate model of each rover is loaded into a centralized planning subprogram. The centralized planning software uses the models of the rovers plus an iterative repair algorithm to resolve conflicts posed by demands for resources and by constraints associated with the all the rovers and the shared hardware. During repair, heuristics are used to make planning decisions that will result in solutions that will be better and will be found faster than would otherwise be possible. In particular, techniques from prior solutions of the multiple-traveling- salesmen problem are used as heuristics to generate plans in which the paths taken by the rovers to assigned scientific targets are shorter than they would otherwise be.


    Access

    Access via TIB

    Check availability in my library


    Export, share and cite



    Title :

    Centralized Planning for Multiple Exploratory Robots


    Contributors:


    Publication date :

    2005-05-01


    Type of media :

    Miscellaneous


    Type of material :

    No indication


    Language :

    English





    Planning of workplaces with multiple kinematically redundant robots

    Konietschke, Rainer Christian | TIBKAT | 2007


    Planning for Multiple Robots in a Smart Environment

    M. D. Rocco / F. Pecora / A. Saffiotti et al. | BASE | 2013

    Free access

    Motion planning in R3 for multiple tethered robots

    Hert, S. / Lumelsky, V. | Tema Archive | 1999


    Distributed Cooperative Motion Planning for Multiple Articulated Robots

    Wang, M. / Wu, T. / Tu, D. et al. | British Library Online Contents | 2011