Constraint-Based Planning and Generation Algorithms

Algorithms that produce a plan or a structure by satisfying a set of constraints. Model synthesis, also known as wave function collapse, is a family of constraint-solving algorithms commonly used in procedural generation, where a large model resembles a small example because every piece must fit its neighbors, and kinodynamic planning covers motion planning problems in which bounds on velocity, acceleration and force must be met together with kinematic constraints such as avoiding obstacles. An algorithm belongs here when its cited article describes building a result, such as a layout or a trajectory, under constraints. It excludes route search in an abstract graph, which belongs with the heuristic graph search and pathfinding algorithms, and maze and network generators, which sit with the graph algorithms.