Have N points on the plane and the N points there are a number of S is defined as the starting point (and end), the remaining N - S point is defined as the path points, N point there is a communication path between two connected, but is not necessarily the two next to define a vehicle, vehicle from each point S start, finally returned to the point S, will experience the specified path, each vehicle may specify different paths (the specified path is a subset of the set of each path, the path specified direction), and after every path point being stranded time tn, vehicle amount is enough, can start at any time, so how to design a set of algorithms, or is thinking about, can guarantee the path in the unit time the number of vehicles back to the point S is the largest, and not block in the path, it is not clear if there is any similar algorithms can refer to, please advice way greatly, thank you
Figure is an example for the understanding, in the attachment is exchanged, the arrow for the direction of the specified path, a simple one
CodePudding user response:
Branch threshold method,MIT courses: artificial intelligence;
the fifth lessonhttps://www.bilibili.com/video/av17963543? p=5