Planning for a Mobile Robot to Attend a Conference

  • Eric Beaudry
  • Froduald Kabanza
  • Francois Michaud
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3501)


The AAAI Mobile Robot Challenge requires robots to start from the entrance of the conference site, find their own way to the registration desk, socially interact with people and perform volunteer duties as required, then report at a prescribed time in a conference hall to give a talk and answer questions. These specifications convey some interesting planning problems that appear to be too complex for some of the most efficient AI planning systems that we analyzed. Based on this analysis, we present a new planning approach that we are developing to meet the challenge. Preliminary results show that our approach performs much better on robot conference planning problems than any of the other AI planning systems we tested.


Mobile Robot Robot Platform Conference Site Primitive Task Robot Architecture 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Cimatti, A., Pistore, M., Roveri, M., Traverso, P.: Weak, strong, and strong cyclic planning via symbolic model checking. Artificial Intelligence 147(1-2), 35–84 (2003)MathSciNetzbMATHGoogle Scholar
  2. 2.
    Do, M.B., Kambhampati, S.: Sapa: A scalable multi-objective metric temporal planner. Journal of Artificial Intelligence Research 20, 155–194 (2003)zbMATHGoogle Scholar
  3. 3.
    Ingrand, F. F., Despouys, O.: Extending procedural reasoning toward robot actions planning. In: ICRA 2001, pp. 9–14 (2001)Google Scholar
  4. 4.
    Haigh, K.Z., Veloso, M.: Interleaving planning and robot execution for asynchronous user requests. Autonomous Robots (1998)Google Scholar
  5. 5.
    Hoffmann, J.: The Metric-FF planning system: Translating ”ignoring delete lists” to numeric state variables. Journal of Artificial Intelligence 20, 291–341 (2003)zbMATHGoogle Scholar
  6. 6.
    Maxwell, B.A., Smart, W., Jacoff, A., Casper, J., Weiss, B., Scholtz, J., Yanco, H., Micire, M., Stroupe, A., Stormont, D., Lauwers, T.: 2003 AAAI robot competition and exhibition. AI Magazine 25(2), 68–80 (2004)Google Scholar
  7. 7.
    Michaud, F.: EMIB - computational architecture based on emotion and motivation for intentional selection and configuration of behaviour-producing modules. Cognitive Science Quarterly, 340–361 (2002)Google Scholar
  8. 8.
    Michaud, F., Audet, J., Létourneau, D., Lussier, L., Théberge-Turmel, C., Caron, S.: Experiences with an autonomous robot attending the AAAI conference. IEEE Intelligent Systems 16(5), 23–29 (2001)Google Scholar
  9. 9.
    Nau, D.S., Au, T.C., Ilghami, O., Kuter, U., Murdock, J.W., Wu, D., Yaman, F.: SHOP2: An HTN planning system. Journal of Artificial Intelligence Research 20, 379–404 (2003)zbMATHGoogle Scholar
  10. 10.
    Nicolescu, M., Mataric, M.J.: Deriving and using abstract representation in behavior-based systems. In: National Conference on Artificial Intelligence 2000, p. 1087 (2000)Google Scholar
  11. 11.
    Smith, D.E., Frank, J., Jonsson, A.R.: Bridging the gap between planning and scheduling. Knowledge Engineering Review 15(1) (2000)Google Scholar
  12. 12.
    Weld, D.S., Anderson, C.R., Smith, D.E.: Extending graphplan to handle uncertainty & sensing actions. In: National Conference on Artificial Intelligence 1998, pp. 897–904 (1998)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Eric Beaudry
    • 1
  • Froduald Kabanza
    • 1
  • Francois Michaud
    • 1
  1. 1.Université de SherbrookeSherbrookeCanada

Personalised recommendations