3 citations · 7 across the 5 of their papers we have counts for
14 papers · 1 filter
RPT*: Global Planning with Probabilistic Terminals for Target Search in Complex Environments
Yunpeng Lyu, Chao Cao, Ji Zhang +2
Routing problems such as Hamiltonian Path Problem (HPP), seeks a path to visit all the vertices in a graph while minimizing the path cost. This paper studies a variant, HPP with Pr…
Parallel, Asymptotically Optimal Algorithms for Moving Target Traveling Salesman Problems
Anoop Bhat, Geordan Gutow, Bhaskar Vundurthy +3
The Moving Target Traveling Salesman Problem (MT-TSP) seeks a trajectory that intercepts several moving targets, within a particular time window for each target. When generic nonli…
A Complete and Bounded-Suboptimal Algorithm for a Moving Target Traveling Salesman Problem with Obstacles in 3D
Anoop Bhat, Geordan Gutow, Bhaskar Vundurthy +3
The moving target traveling salesman problem with obstacles (MT-TSP-O) seeks an obstacle-free trajectory for an agent that intercepts a given set of moving targets, each within spe…
A Mixed-Integer Conic Program for the Multi-Agent Moving-Target Traveling Salesman Problem
Allen George Philip, Zhongqiang Ren, Sivakumar Rathinam +1
The Moving-Target Traveling Salesman Problem (MT-TSP) seeks a shortest path for an agent that starts at a stationary depot, visits a set of moving targets exactly once, each within…
A Complete Algorithm for a Moving Target Traveling Salesman Problem with Obstacles
Anoop Bhat, Geordan Gutow, Bhaskar Vundurthy +3
The moving target traveling salesman problem with obstacles (MT-TSP-O) is a generalization of the traveling salesman problem (TSP) where, as its name suggests, the targets are movi…
Propagative Distance Optimization for Constrained Inverse Kinematics
Yu Chen, Yilin Cai, Jinyun Xu +3
This paper investigates a constrained inverse kinematic (IK) problem that seeks a feasible configuration of an articulated robot under various constraints such as joint limits and…