2 problems
- 0 votes0 replies0 views
The initial-discrepancy conjecture for auction path planning
Initial-discrepancy conjecture. If all the discrepancies are initially bounded by a small multiple of , then the path produced by the algorithm upon termination…
- 0 votes0 replies1 view
The closed-loop uncertainty path-planning conjecture
A vehicle path planner operates in an environment with disturbances and uncertainty; open-loop uncertainty is uncertainty in the system state that is not controlled and typically i…