The path simplification technique in the post is called "shortcutting" in robotics. Here [1] is some approachable explanation, the original paper [2] is relativ

The path simplification technique in the post is called "shortcutting" in robotics. Here [1] is some approachable explanation, the original paper [2] is relatively digestible read as well, and has some other techniques in there (amongs thm, partial shortcutting, which I found extremely helpful in robotics path planning). Regarding general multi agent path finding: There is a lot of literature around with respect to time optimal planning in MAPF both in robotics, and in adjacent fields. [1] http://www.osrobotics.org/osr/planning/post_processing.html http://www.osrobotics.org/osr/planning/post_processing.html [2] https://citeseerx.ist.psu.edu/document?repid=rep1&type=pdf&doi=ed223f20c1677e50dbda5de48f2e7d5a9239b2cc https://citeseerx.ist.psu.edu/document?repid=rep1&type=pdf&d...