Algorithms for Min-Color Path with Bounded Color-DegreeResearch Paper
A robot that must move from to through a field of obstacles, or a signal that must cross a sensor field, wants to cross as few obstacles as possible. Discretized, this is Min-Color Path: the obstacles become colors on the vertices of an arrangement graph and one asks for an – path touching the fewest colors. The problem appears as Minimum Constraint…