State-set search is state space search when the states being manipulated by the search algorithm are sets of states from some underlying state space. State-set search arises commonly in planning and abstraction systems, but this paper provides the first formal, general analysis of state-set search. We show that the state-set distance computed by planning systems is different than that computed ...

This paper discusses a planner of the semantics of utterances, whose essential design is an epistemic theorem prover. The planner was designed for the purpose of planning communicative actions, whose effects are famously unknowable and unobservable by the doer/speaker, and depend on the beliefs of and inferences made by the recipient/hearer. The fully implemented model can achieve goals that do...

This paper proposes a domain independent heuristic for state space planning, which is based on action evaluation. The heuristic obtains estimates for the cost of applying each action of the domain by performing a forward search in a relaxed version of the initial problem. The estimates for the actions are then utilized in a backward search on the original problem. The heuristic, which has been ...

Current domain-independent, classical planners require symbolic models of the problem domain and instance as input, resulting in a knowledge acquisition bottleneck. Meanwhile, although deep learning has achieved significant success many fields, is encoded subsymbolic representation which incompatible with systems such planners. We propose Latplan, an unsupervised architecture combining planning...

This paper proposes a genetic algorithm (GA) for path planning of an autonomous mobile robot in the 3-D space which is modeled with a grid structure. We present a GA for 2-D path planning and then generalize it to 3-D path planning. Some simulation results are also presented. The GA has two unique features. First, the dimension has only small e ect on time and space requirements. Second, it is ...

A novel approach to perform motion planning on 2 or 3 degrees-of-freedom manipulators utilising a fluid motion planning model is proposed. It is demonstrated that through the introduction of transformations, the conventional trajectory planning problem in the configuration space (C-space) can be efficiently solved from the closed form solution of the fluid motion planner. The proposed motion pl...