Robot manipulation of multiple objects is an important topic for applications including
warehouse automation, service robots performing cleaning, and large-scale object sorting …

Mobile robot path planning involves designing optimal routes from starting points to
destinations within specific environmental conditions. Even though there are well …

In the multi-agent pathfinding problem (MAPF) we are given a set of agents each with
respective start and goal positions. The task is to find paths for all agents while avoiding …

Planning optimal paths for large numbers of robots is computationally expensive. In this
paper, we introduce a new framework for multirobot path planning called subdimensional …

Reconfiguration is concerned with relationships among solutions to a problem instance,
where the reconfiguration of one solution to another is a sequence of steps such that each …

I present several computational complexity results for propositional STRIPS planning, ie,
STRIPS planning restricted to ground formulas. Different planning problems can be defined …

We address the problem of optimal pathfinding for multiple agents. Given a start state and a
goal state for each of the agents, the task is to find minimal paths for the different agents …

Recent advancements in Large Language Models (LLMs) have revolutionized decision-
making by breaking down complex problems into more manageable language sequences …

The efficiency of A* searching depends on the quality of the lower bound estimates of the
solution cost. Pattern databases enumerate all possible subgoals required by any solution …

This handbook provides an up-to-date compendium of fundamental computer science
topics, techniques, and applications. Along with updating and revising many of the existing …