Makoto Yokoo

Distributed Constraint Optimization Problem (DCOP) has been studied as a fundamental component of multiagent systems. With DCOPs, various applications on multiagent systems are formalized as constraint optimization problems where variables and functi

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 probl

Distributed Constraint Reasoning: 10.4018/978-1-59904-849-9.ch077: Distributed constraint reasoning is concerned with modeling and solving naturally distributed problems. It has application to the coordination and negotiation

総合学術電子ジャーナルサイト「J-STAGE」－国内で発行された学術論文全文を読むことのできる、日本最大級の総合電子ジャーナルプラットフォームです。