Skip to main content
SpringerLink
Log in

STeLLa: An Optimal Sequential and Parallel Planner

  • Conference paper
  • First Online:
Progress in Artificial Intelligence (EPIA 2001)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2258))

Included in the following conference series:

Abstract

In the last few years, the field of planning in AI has experimented a great advance. Nowadays, one can use planners that solve complex problems in a few seconds. However, building good quality plans has not been a main issue. In this paper, we introduce a planning system whose aim is obtaining the optimal solution w.r.t. the number of actions and maintaining as maximum number of parallel actions as possible.

This work has been partially supported by the project n. 20010017 - Navigation for Autonomous Mobile Robots of the Universidad Politecnica de Valencia

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. F. Bacchus. AIPS-2000 competition results. Technical report, University of Toronto, 2000. http://www.cs.toronto.edu/aips2000/.

  2. M. Fox and D. Long. The automatic inference of state invariants in TIM. Journal of Artificial Intelligence Research, 9:367–421, 1998.

    MATH  Google Scholar 

  3. B. Bonet and H. Geffner. Planning as Heuristic Search. Artificial Intelligence, 2001, forthcoming.

    Google Scholar 

  4. P. Haslum and H. Geffner. Admissible heuristics for optimal planning. In International Conference on AI Planning and Scheduling, 2000.

    Google Scholar 

  5. J. Hoffmann and B. Nebel. The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research, 14:253–302, 2001.

    MATH  Google Scholar 

  6. J. Koehler, B. Nebel, J. Hoffmann, and Y. Dimopoulos. Extending planning graphs to an ADL subset. In Fourth European Conference in Planning, pages 273–285. Springer LNAI 1348, 1997.

    Google Scholar 

  7. D. Long and M. Fox. Efficient implementation of the plan graph in stan. Journal of Artificial Intelligence Research, 10:87–115, 1999.

    MATH  Google Scholar 

  8. D. McDermott. AIPS-98 competition results, 1998. ftp://ftp.cs.yale.edu/pub/mcdermott/aipscomp-results.html.

  9. J. Porteous and L. Sebastia. Extracting and ordering landmarks for planning. In 19th Workshop of the UK Planning and Scheduling Special Interest Group, 2000.

    Google Scholar 

  10. J. Porteous, L. Sebastia, and J. Hoffmann. On the extraction, ordering, and usage of landmarks in planning. In Recent Advances in AI Planning. 6th European Conference on Planning (ECP’01). Springer Verlag, 2001.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dpto. Sistemas Informaticos y Computation, Universidad Politecnica de Valencia, Germany

    L. Sebastia, E. Onaindia & E. Marzal

Authors
  1. L. Sebastia
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. E. Onaindia
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. E. Marzal
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Economics LIACC, Laboratório de Inteligência Artificial e Ciência de Computadores, University of Porto, Rua do Campo Alegre, 823, 4150-180, Porto, Portugal

    Pavel Brazdil  & Alípio Jorge  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sebastia, L., Onaindia, E., Marzal, E. (2001). STeLLa: An Optimal Sequential and Parallel Planner. In: Brazdil, P., Jorge, A. (eds) Progress in Artificial Intelligence. EPIA 2001. Lecture Notes in Computer Science(), vol 2258. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45329-6_40

Download citation

  • DOI: https://doi.org/10.1007/3-540-45329-6_40

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43030-8

  • Online ISBN: 978-3-540-45329-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation