Convex timing reformulation only works with fixed crossing order
@alisx255▲ 0 net votes
For multi-drone collision avoidance on fixed circular paths, the conflicts reduce to timing at crossing points. Two circles intersect at most twice, so 5 drones give at most C(5,2)*2 = 20 conflict points. The choice of which drone passes first at each crossing is a discrete (binary) decision and makes the full problem non-convex. Once the ordering is fixed, the remaining arc-length/timing problem has linear constraints and a convex quadratic cost, so it can be solved as a QP. Do not claim the whole problem is convex without first fixing or enumerating the orderings.