Skip to main content

A New Approach to Iterative Deepening Multiobjective A*

  • Conference paper
AI*IA 2009: Emergent Perspectives in Artificial Intelligence (AI*IA 2009)

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

Included in the following conference series:

Abstract

Multiobjective search is a generalization of the Shortest Path Problem where several (usually conflicting) criteria are optimized simultaneously. The paper presents an extension of the single-objective IDA* search algorithm to the multiobjective case. The new algorithm is illustrated with an example, and formal proofs are presented on its termination, completeness, and admissibility. The algorithm is evaluated over a set of random tree search problems, and is found to be more efficient than IDMOA*, a previous extension of IDA* to the multiobjective case.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Harikumar, S., Kumar, S.: Multiobjective search based algorithms for circuit partitioning problem for acceleration of logic simulation. In: Tenth Int. Conf. on VLSI Design, pp. 239–242 (1997)

    Google Scholar 

  2. Dasgupta, P., Chakrabarti, P.P., DeSarkar, S.C.: Multiobjective Heuristic Search. Vieweg, Braunschweig/Wiesbaden (1999)

    MATH  Google Scholar 

  3. Refanidis, I., Vlahavas, I.: Multiobjective heuristic state-space search. Artificial Intelligence 145, 1–32 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  4. Hansen, P.: Bicriterion path problems. Lecture Notes in Economics and Mathematical Systems, vol. 177, pp. 109–127. Springer, Heidelberg (1979)

    Google Scholar 

  5. Müller-Hannemann, M., Weihe, K.: On the cardinality of the pareto set in bicriteria shortest path problems. Annals OR 147(1), 269–286 (2006)

    Google Scholar 

  6. Korf, R.E.: Iterative-deepening A*: an optimal admissible tree search. In: Proc. of the IX Int. Joint Conf. on Artificial Intelligence (IJCAI 1985), pp. 1034–1036 (1985)

    Google Scholar 

  7. Korf, R.E.: Linear-space best-first search. Artificial Intelligence 62, 41–78 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  8. Harikumar, S., Kumar, S.: Iterative deepening multiobjective A*. Information Processing Letters 58, 11–15 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  9. Korf, R.E.: Depth first iterative deepening: an optimal admissible tree search. Artificial Intelligence 27, 97–109 (1985)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Coego, J., Mandow, L., Pérez de la Cruz, J.L. (2009). A New Approach to Iterative Deepening Multiobjective A*. In: Serra, R., Cucchiara, R. (eds) AI*IA 2009: Emergent Perspectives in Artificial Intelligence. AI*IA 2009. Lecture Notes in Computer Science(), vol 5883. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10291-2_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-10291-2_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-10290-5

  • Online ISBN: 978-3-642-10291-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics