Skip to main content

Empirical Methods for Evaluating Properties of Configuration Planning Algorithms

  • Conference paper
Evolving Ambient Intelligence (AmI 2013)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 413))

Included in the following conference series:

Abstract

As the field of configuration planning grows, so does the need for objective comparisons of algorithms and results. As the community stands today, different approaches to formalise and solve the problem at hand exist, and little or no importance has been given to compare results of different research groups. In this paper we summarize the definitions used by a few different research groups, and we explain two empiric method for comparing planning algorithms, based on statistics. While the methods themselves do not solve all the problems of comparative studies, it is a first step towards numerically comparing performances of the different configuration planning methods proposed by the community.

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

Access this chapter

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. Coles, A., Coles, A., Olaya, A.G., Jiménez, S., López, C.L., Sanner, S., Yoon, S.: A survey of the seventh international planning competition. AI Magazine 33(1), 83–88 (2012)

    Google Scholar 

  2. Di Rocco, M., Pecora, F., Sivakumar, P.K., Saffiotti, A.: Configuration planning with multiple dynamic goals. In: Proceedings of the AAAI Spring Symposium on Designing Intelligent Robots, Stanford, California (2013)

    Google Scholar 

  3. Hinkelmann, K.: Design and Analysis of Experiments, Special Designs and Applications, vol. 3 (2012), http://Wiley.com

  4. Motwani, R.: Randomized algorithms. Cambridge University Press (1995)

    Google Scholar 

  5. Nebel, B., Koehler, J.: Plan reuse versus plan generation: a theoretical and empirical analysis. Artificial Intelligence 76(12), 427–454 (1995)

    Article  Google Scholar 

  6. Parker, L.E., Tang, F.: Building multirobot coalitions through automated task solution synthesis. Proceedings of the IEEE 94(7), 1289–1305 (2006)

    Article  Google Scholar 

  7. Lundh, R., Saffiotti, L.K., Autonomous, A.: Autonomous functional configuration of a network robot system. Robotics and Autonomous Systems. Elsevier (2008)

    Google Scholar 

  8. Rumsey, D.: Intermediate statistics for dummies. Wiley Publishing, Inc., Indianapolis (2007)

    Google Scholar 

  9. Winston, A.S., Blais, D.J.: What counts as an experiment?: A transdisciplinary analysis of textbooks, 1930-1970. The American Journal of Psychology, 599–616 (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer International Publishing

About this paper

Cite this paper

Silva-Lopez, L.S.d.C., Broxvall, M. (2013). Empirical Methods for Evaluating Properties of Configuration Planning Algorithms. In: O’Grady, M.J., et al. Evolving Ambient Intelligence. AmI 2013. Communications in Computer and Information Science, vol 413. Springer, Cham. https://doi.org/10.1007/978-3-319-04406-4_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-04406-4_12

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-04405-7

  • Online ISBN: 978-3-319-04406-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics