C*: A New Bounding Approach for the Moving-Target Traveling Salesman Problem.
Allen George PhilipZhongqiang RenSivakumar RathinamHowie ChosetPublished in: CoRR (2023)
Keyphrases
- moving target
- traveling salesman problem
- combinatorial optimization
- upper bound
- motion detection
- ant colony optimization
- real time
- moving objects
- optimization problems
- genetic local search
- moving target detection
- traveling salesman
- discrete optimization problems
- cost function
- subtour elimination
- motion segmentation
- feature points
- moving camera
- digital images
- hamiltonian cycle
- lower bound
- computer vision