AI Planning is inherently hard and hence it is desirable to derive as much information as we can from the structure of the planning problem and let this information be exploited by a planner. Many recent planners use the finite-domain state-variable representation of the problem instead of the traditional propositional representation. However, most planning problems are still specified in the p...

We present results regarding the existence, regularity and uniqueness of solutions master equation associated with mean field planning problem in finite state space case, presence a common noise. The hold under monotonicity assumptions, which are used crucially, different proofs paper. also make link trajectories induced by solution start discussion on case boundary conditions.

Planning is a form of general problem solving. It has been one of the main topics of interest in AI from the outset. The task in the field is to design problem solving techniques that can be applied to arbitrary problem domains and that thus model, or imitate, one of the distinguishing qualities of humans: the ability to reason about unseen domains. The overall goal in the field can be formulat...