• DocumentCode
    2358157
  • Title

    S-MEP: a planner for numeric goals

  • Author

    Sanchez, Javier ; Mali, Amol Dattatraya

  • Author_Institution
    Dept. of Electr. Eng. & Comput. Sci., Wisconsin Univ., Milwaukee, WI, USA
  • fYear
    2003
  • fDate
    3-5 Nov. 2003
  • Firstpage
    274
  • Lastpage
    283
  • Abstract
    Planning for numeric goals is an important problem. Only one of the many participants from the 2002 international planning competition (Metric-FF) can effectively handle problems containing numeric goal expressions. We report on planner S-MEP (sequential more expressive planner) in this paper. S-MEP handles non-linear as well as linear expressions in preconditions, effects and goal. Metric-FF handles only linear expressions. Metric-FF ignores decrease effects of actions while computing the heuristic information. S-MEP considers decrease effects of actions while computing heuristic information. We report on empirical evaluation of S-MEP and its comparison with two versions of Metric-FF on 400 problems from linear Jugs domain, 120 problems from linear short-move-Karel domain and 120 problems from linear long-move-Karel domain. Karel domains are robotic transportation domains and Jugs domain is a fluid transfer domain. S-MEP solves many problems that neither version of metric-FF can solve.
  • Keywords
    numerical analysis; planning (artificial intelligence); Metric-FF; S-MEP; fluid transfer domain; heuristic information; linear Jugs domain; linear expression; linear long-move-Karel domain; linear short-move-Karel domain; nonlinear expression; numeric goal expression; planning; robotic transportation domain; sequential more expressive planner; Artificial intelligence; Computer science; Costs; Elevators; Robot kinematics; Strips; Transportation;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Tools with Artificial Intelligence, 2003. Proceedings. 15th IEEE International Conference on
  • ISSN
    1082-3409
  • Print_ISBN
    0-7695-2038-3
  • Type

    conf

  • DOI
    10.1109/TAI.2003.1250201
  • Filename
    1250201