Alcázar, Vidal
Autonomous Mobile Robot Control and Learning with the PELEA Architecture
Quintero, Ezequiel (Universidad Carlos III de Madrid) | Alcázar, Vidal (Universidad Carlos III de Madrid) | Borrajo, Daniel (Universidad Carlos III de Madrid) | Fdez-Olivares, Juan (Universidad de Granada) | Fernández, Fernando (Universidad Carlos III de Madrid) | García-Olaya, Ángel (Universidad Carlos III de Madrid) | Guzmán, César (Universidad Politecnica de Valencia) | Onaindía, Eva (Universidad Politecnica de Valencia) | Prior, David (Universidad de Granada)
In this paper we describe the integration of a robot control platform (Player/Stage) and a real robot (Pioneer P3DX) with PELEA (Planning, Execution and LEarning Architecture). PELEA is a general-purpose planning architecture suitable for a wide range of real world applications, from robotics to emergency management. It allows planning engineers to generate planning applications since it integrates planning, execution, replanning, monitoring and learning capabilities. We also present a relational learning approach for automatically modeling robot-action execution durations, with the purpose of improving the planning process of PELEA by refining domain definitions.
Using Backwards Generated Goals for Heuristic Planning
Alcázar, Vidal (Universidad Carlos III de Madrid) | Borrajo, Daniel (Universidad Carlos III de Madrid) | López, Carlos Linares (Universidad Carlos III de Madrid)
Forward State Planning with Reachability Heuristics is arguably the most successful approach to Automated Planning up to date. In addition to an estimation of the distance to the goal, relaxed plans obtained with such heuristics provide the search with useful information such as helpful actions and look-ahead states. However, this information is extracted only from the beginning of the relaxed plan. In this paper, we propose using information extracted from the last actions in the relaxed plan to generate intermediate goals backwards. This allows us to use information from previous computations of the heuristic and reduce the depth of the search tree.