loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Toshihiro Matsui 1 ; Marius Silaghi 2 ; Katsutoshi Hirayama 3 ; Makoto Yokoo 4 and Hiroshi Matsuo 1

Affiliations: 1 Nagoya Institute of Technology, Japan ; 2 Florida Institute of Technology, United States ; 3 Kobe University, Japan ; 4 Kyushu University, Japan

Keyword(s): Bottleneck, Fairness, Dynamic Programming, Search, A*, Route Optimization.

Related Ontology Subjects/Areas/Topics: Agents ; Artificial Intelligence ; Cooperation and Coordination ; Formal Methods ; Group Decision Making ; Informatics in Control, Automation and Robotics ; Intelligent Control Systems and Optimization ; Planning and Scheduling ; Simulation and Modeling ; State Space Search ; Symbolic Systems ; Task Planning and Execution

Abstract: Route optimization is an important problem for single agents and multi-agent systems. In route optimization tasks, the considered challenges generally belong to the family of shortest path problems. Such problems are solved using optimization algorithms, such as the A* algorithm, which is based on tree search and dynamic programming. In several practical cases, cost values should be as evenly minimized for individual parts of paths as possible. These situations are also considered as multi-objective problems for partial paths. Since dynamic programming approaches are employed for the shortest path problems, different types of criteria which can be decomposed with dynamic programming might be applied to the conventional solution methods. For this class of problems, we employ a leximax-based criterion, which considers the bottlenecks and unfairness among the cost values of partial paths. This criterion is based on a similar criterion called leximin for multi-objective maximization prob lems. It is also generalized for objective vectors which have variable lengths. We address an extension of the conventional A* search algorithm and investigate an issue concerning on-line search algorithms. The influence of the proposed approach is experimentally evaluated. (More)

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 54.146.154.243

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Matsui, T.; Silaghi, M.; Hirayama, K.; Yokoo, M. and Matsuo, H. (2018). Study of Route Optimization Considering Bottlenecks and Fairness Among Partial Paths. In Proceedings of the 10th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART; ISBN 978-989-758-275-2; ISSN 2184-433X, SciTePress, pages 37-47. DOI: 10.5220/0006589000370047

@conference{icaart18,
author={Toshihiro Matsui. and Marius Silaghi. and Katsutoshi Hirayama. and Makoto Yokoo. and Hiroshi Matsuo.},
title={Study of Route Optimization Considering Bottlenecks and Fairness Among Partial Paths},
booktitle={Proceedings of the 10th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART},
year={2018},
pages={37-47},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006589000370047},
isbn={978-989-758-275-2},
issn={2184-433X},
}

TY - CONF

JO - Proceedings of the 10th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART
TI - Study of Route Optimization Considering Bottlenecks and Fairness Among Partial Paths
SN - 978-989-758-275-2
IS - 2184-433X
AU - Matsui, T.
AU - Silaghi, M.
AU - Hirayama, K.
AU - Yokoo, M.
AU - Matsuo, H.
PY - 2018
SP - 37
EP - 47
DO - 10.5220/0006589000370047
PB - SciTePress