• Skip to main content
  • Skip to primary sidebar
AAAI

AAAI

Association for the Advancement of Artificial Intelligence

    • AAAI

      AAAI

      Association for the Advancement of Artificial Intelligence

  • About AAAIAbout AAAI
    • AAAI Officers and Committees
    • AAAI Staff
    • Bylaws of AAAI
    • AAAI Awards
      • Fellows Program
      • Classic Paper Award
      • Dissertation Award
      • Distinguished Service Award
      • Allen Newell Award
      • Outstanding Paper Award
      • Award for Artificial Intelligence for the Benefit of Humanity
      • Feigenbaum Prize
      • Patrick Henry Winston Outstanding Educator Award
      • Engelmore Award
      • AAAI ISEF Awards
      • Senior Member Status
      • Conference Awards
    • AAAI Resources
    • AAAI Mailing Lists
    • Past AAAI Presidential Addresses
    • Presidential Panel on Long-Term AI Futures
    • Past AAAI Policy Reports
      • A Report to ARPA on Twenty-First Century Intelligent Systems
      • The Role of Intelligent Systems in the National Information Infrastructure
    • AAAI Logos
    • News
  • aaai-icon_ethics-diversity-line-yellowEthics & Diversity
  • Conference talk bubbleConferences & Symposia
    • AAAI Conference
    • AIES AAAI/ACM
    • AIIDE
    • IAAI
    • ICWSM
    • HCOMP
    • Spring Symposia
    • Summer Symposia
    • Fall Symposia
    • Code of Conduct for Conferences and Events
  • PublicationsPublications
    • AAAI Press
    • AI Magazine
    • Conference Proceedings
    • AAAI Publication Policies & Guidelines
    • Request to Reproduce Copyrighted Materials
  • aaai-icon_ai-magazine-line-yellowAI Magazine
    • Issues and Articles
    • Author Guidelines
    • Editorial Focus
  • MembershipMembership
    • Member Login
    • Developing Country List
    • AAAI Chapter Program

  • Career CenterCareer Center
  • aaai-icon_ai-topics-line-yellowAITopics
  • aaai-icon_contact-line-yellowContact

Home / Proceedings / Proceedings of the International Conference on Automated Planning and Scheduling, 32 / Book One

A*pex: Efficient Approximate Multi-Objective Search on Graphs

February 1, 2023

Download PDF

Authors

Han Zhang,Oren Salzman,T. K. Satish Kumar,Ariel Felner,Carlos Hernández Ulloa,Sven Koenig

University of Southern California,Technion, Israel Institute of Technology,University of Southern California,Ben-Gurion University of the Negev,Universidad San Sebastian,University of Southern California


DOI:

10.1609/icaps.v32i1.19825


Abstract:

In multi-objective search, edges are annotated with cost vectors consisting of multiple cost components. A path dominates another path with the same start and goal vertices iff the component-wise sum of the cost vectors of the edges of the former path is ``less than'' the component-wise sum of the cost vectors of the edges of the latter path. The Pareto-optimal solution set is the set of all undominated paths from a given start vertex to a given goal vertex. Its size can be exponential in the size of the graph being searched, which makes multi-objective search time-consuming. In this paper, we therefore study how to find an approximate Pareto-optimal solution set for a user-provided vector of approximation factors. The size of such a solution set can be significantly smaller than the size of the Pareto-optimal solution set, which enables the design of approximate multi-objective search algorithms that are efficient and produce small solution sets. We present such an algorithm in this paper which we call A*pex and which builds on PP-A*, a state-of-the-art approximate bi-objective search algorithm (where there are only two cost components) but (1) makes PP-A* more efficient for bi-objective search and (2) generalizes it to multi-objective search for any number of cost components. We first analyze the correctness of A*pex and then experimentally demonstrate its efficiency advantage over existing approximate algorithms for bi- and tri-objective search.

Topics: ICAPS

Primary Sidebar

HOW TO CITE:

Han Zhang,Oren Salzman,T. K. Satish Kumar,Ariel Felner,Carlos Hernández Ulloa,Sven Koenig A*pex: Efficient Approximate Multi-Objective Search on Graphs Proceedings of the International Conference on Automated Planning and Scheduling, 32 (2022) 394-403.

Han Zhang,Oren Salzman,T. K. Satish Kumar,Ariel Felner,Carlos Hernández Ulloa,Sven Koenig A*pex: Efficient Approximate Multi-Objective Search on Graphs ICAPS 2022, 394-403.

Han Zhang,Oren Salzman,T. K. Satish Kumar,Ariel Felner,Carlos Hernández Ulloa,Sven Koenig (2022). A*pex: Efficient Approximate Multi-Objective Search on Graphs. Proceedings of the International Conference on Automated Planning and Scheduling, 32, 394-403.

Han Zhang,Oren Salzman,T. K. Satish Kumar,Ariel Felner,Carlos Hernández Ulloa,Sven Koenig. A*pex: Efficient Approximate Multi-Objective Search on Graphs. Proceedings of the International Conference on Automated Planning and Scheduling, 32 2022 p.394-403.

Han Zhang,Oren Salzman,T. K. Satish Kumar,Ariel Felner,Carlos Hernández Ulloa,Sven Koenig. 2022. A*pex: Efficient Approximate Multi-Objective Search on Graphs. "Proceedings of the International Conference on Automated Planning and Scheduling, 32". 394-403.

Han Zhang,Oren Salzman,T. K. Satish Kumar,Ariel Felner,Carlos Hernández Ulloa,Sven Koenig. (2022) "A*pex: Efficient Approximate Multi-Objective Search on Graphs", Proceedings of the International Conference on Automated Planning and Scheduling, 32, p.394-403

Han Zhang,Oren Salzman,T. K. Satish Kumar,Ariel Felner,Carlos Hernández Ulloa,Sven Koenig, "A*pex: Efficient Approximate Multi-Objective Search on Graphs", ICAPS, p.394-403, 2022.

Han Zhang,Oren Salzman,T. K. Satish Kumar,Ariel Felner,Carlos Hernández Ulloa,Sven Koenig. "A*pex: Efficient Approximate Multi-Objective Search on Graphs". Proceedings of the International Conference on Automated Planning and Scheduling, 32, 2022, p.394-403.

Han Zhang,Oren Salzman,T. K. Satish Kumar,Ariel Felner,Carlos Hernández Ulloa,Sven Koenig. "A*pex: Efficient Approximate Multi-Objective Search on Graphs". Proceedings of the International Conference on Automated Planning and Scheduling, 32, (2022): 394-403.

Han Zhang,Oren Salzman,T. K. Satish Kumar,Ariel Felner,Carlos Hernández Ulloa,Sven Koenig. A*pex: Efficient Approximate Multi-Objective Search on Graphs. ICAPS[Internet]. 2022[cited 2023]; 394-403.


ISSN: 2334-0843


Published by AAAI Press, Palo Alto, California USA
Copyright 2022, Association for the Advancement of
Artificial Intelligence 1900 Embarcadero Road, Suite
101, Palo Alto, California 94303 All Rights Reserved

We use cookies on our website to give you the most relevant experience by remembering your preferences and repeat visits. By clicking “Accept All”, you consent to the use of ALL the cookies. However, you may visit "Cookie Settings" to provide a controlled consent.
Cookie SettingsAccept All
Manage consent

Privacy Overview

This website uses cookies to improve your experience while you navigate through the website. Out of these, the cookies that are categorized as necessary are stored on your browser as they are essential for the working of basic functionalities of the website. We also use third-party cookies that help us analyze and understand how you use this website. These cookies will be stored in your browser only with your consent. You also have the option to opt-out of these cookies. But opting out of some of these cookies may affect your browsing experience.
Necessary
Always Enabled
Necessary cookies are absolutely essential for the website to function properly. These cookies ensure basic functionalities and security features of the website, anonymously.
CookieDurationDescription
cookielawinfo-checkbox-analytics11 monthsThis cookie is set by GDPR Cookie Consent plugin. The cookie is used to store the user consent for the cookies in the category "Analytics".
cookielawinfo-checkbox-functional11 monthsThe cookie is set by GDPR cookie consent to record the user consent for the cookies in the category "Functional".
cookielawinfo-checkbox-necessary11 monthsThis cookie is set by GDPR Cookie Consent plugin. The cookies is used to store the user consent for the cookies in the category "Necessary".
cookielawinfo-checkbox-others11 monthsThis cookie is set by GDPR Cookie Consent plugin. The cookie is used to store the user consent for the cookies in the category "Other.
cookielawinfo-checkbox-performance11 monthsThis cookie is set by GDPR Cookie Consent plugin. The cookie is used to store the user consent for the cookies in the category "Performance".
viewed_cookie_policy11 monthsThe cookie is set by the GDPR Cookie Consent plugin and is used to store whether or not user has consented to the use of cookies. It does not store any personal data.
Functional
Functional cookies help to perform certain functionalities like sharing the content of the website on social media platforms, collect feedbacks, and other third-party features.
Performance
Performance cookies are used to understand and analyze the key performance indexes of the website which helps in delivering a better user experience for the visitors.
Analytics
Analytical cookies are used to understand how visitors interact with the website. These cookies help provide information on metrics the number of visitors, bounce rate, traffic source, etc.
Advertisement
Advertisement cookies are used to provide visitors with relevant ads and marketing campaigns. These cookies track visitors across websites and collect information to provide customized ads.
Others
Other uncategorized cookies are those that are being analyzed and have not been classified into a category as yet.
SAVE & ACCEPT