Cover Image

C*: A New Bounding Approach for the Moving-Target Traveling Salesman Problem

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Philip, Allen George, Ren, Zhongqiang, Rathinam, Sivakumar, Choset, Howie
Format:	Preprint
Published:	2023
Subjects:	Robotics Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Mixed-Integer Conic Program for the Moving-Target Traveling Salesman Problem based on a Graph of Convex Sets
by: Philip, Allen George, et al.
Published: (2024)

A Mixed-Integer Conic Program for the Multi-Agent Moving-Target Traveling Salesman Problem
by: Philip, Allen George, et al.
Published: (2025)

Parallel, Asymptotically Optimal Algorithms for Moving Target Traveling Salesman Problems
by: Bhat, Anoop, et al.
Published: (2025)

A Complete Algorithm for a Moving Target Traveling Salesman Problem with Obstacles
by: Bhat, Anoop, et al.
Published: (2024)

A Complete and Bounded-Suboptimal Algorithm for a Moving Target Traveling Salesman Problem with Obstacles in 3D
by: Bhat, Anoop, et al.
Published: (2025)

Optimal Solutions for the Moving Target Vehicle Routing Problem via Branch-and-Price with Relaxed Continuity
by: Bhat, Anoop, et al.
Published: (2026)

On the Approximability of the Traveling Salesman Problem with Line Neighborhoods
by: Antoniadis, Antonios, et al.
Published: (2020)

A faster heuristic for the Traveling Salesman Problem with Drone
by: Hokama, Pedro H. D. B., et al.
Published: (2024)

Optimal Solutions for the Moving Target Vehicle Routing Problem with Obstacles via Lazy Branch and Price
by: Bhat, Anoop, et al.
Published: (2026)

Approximating Traveling Salesman Problems Using a Bridge Lemma
by: Böhm, Martin, et al.
Published: (2024)

Improving polynomial bounds for the Graphical Traveling Salesman Problem with release dates on paths
by: Clementino, Thailsson, et al.
Published: (2025)

Parameterized Complexity of Directed Traveling Salesman Problem
by: Blažej, Václav, et al.
Published: (2025)

A Survey of Approximability Results for Traveling Salesman Problems using the TSP-T3CO Definition Scheme
by: Saller, Sophia, et al.
Published: (2023)

DMS*: Minimizing Makespan for Multi-Agent Combinatorial Path Finding
by: Ren, Zhongqiang, et al.
Published: (2023)

Beware of the Classical Benchmark Instances for the Traveling Salesman Problem with Time Windows
by: Soulignac, Francisco J.
Published: (2025)

A PTAS for Travelling Salesman Problem with Neighbourhoods Over Parallel Line Segments of Similar Length
by: Ghaseminia, Benyamin, et al.
Published: (2025)

A Space-Efficient Algebraic Approach to Robotic Motion Planning
by: Bentert, Matthias, et al.
Published: (2024)

Multi-armed Bandit and Backbone boost Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problems
by: Wang, Long, et al.
Published: (2025)

Effective Traveling for Metric Instances of the Traveling Thief Problem
by: Eube, Jan, et al.
Published: (2026)

Moving Matter: Using a Single, Simple Robot to Reconfigure a Connected Set of Building Blocks
by: Garcia, Javier, et al.
Published: (2025)

The APX-hardness of the Traveling Tournament Problem
by: Zhao, Jingyang, et al.
Published: (2023)

The Canadian Traveller Problem on outerplanar graphs
by: Beaudou, Laurent, et al.
Published: (2024)

On the Power of Spatial Locality on Online Routing Problems
by: Guragain, Swapnil, et al.
Published: (2025)

Heuristic Search for Path Finding with Refuelling
by: Zhao, Shizhe, et al.
Published: (2023)

Learning-Augmented Online TRP on a Line
by: Guragain, Swapnil, et al.
Published: (2026)

Forming Large Patterns with Local Robots in the OBLOT Model
by: Hahn, Christopher, et al.
Published: (2024)

Leveraging Fixed-Parameter Tractability for Robot Inspection Planning
by: Mizutani, Yosuke, et al.
Published: (2024)

Symmetry Preservation in Swarms of Oblivious Robots with Limited Visibility
by: Gerlach, Raphael, et al.
Published: (2024)

Robust Out-of-Order Retrieval for Grid-Based Storage at Maximum Capacity
by: Geft, Tzvika, et al.
Published: (2026)

Line Coverage with Multiple Robots: Algorithms and Experiments
by: Agarwal, Saurav, et al.
Published: (2022)

Fully Packed and Ready to Go: High-Density, Rearrangement-Free, Grid-Based Storage and Retrieval
by: Geft, Tzvika, et al.
Published: (2025)

Two New Upper Bounds for the Maximum k-plex Problem
by: Zheng, Jiongzhi, et al.
Published: (2023)

A Branch-and-Bound Approach for Maximum Low-Diameter Dense Subgraph Problems
by: Zhou, Yi, et al.
Published: (2025)

Stochastic Traveling Salesperson Problem with Neighborhoods for Object Detection
by: Peng, Cheng, et al.
Published: (2024)

The Traveling Tournament Problem: Improved Algorithms Based on Cycle Packing
by: Zhao, Jingyang, et al.
Published: (2024)

Bounding the Average Move Structure Query for Faster and Smaller RLBWT Permutations
by: Brown, Nathaniel K., et al.
Published: (2026)

Time complexity of the Analyst's Traveling Salesman algorithm
by: Ramirez, Anthony, et al.
Published: (2022)

Routing on Sparse Graphs with Non-metric Costs for the Prize-collecting Travelling Salesperson Problem
by: O'Hara, Patrick, et al.
Published: (2024)

Nearly Tight Bounds for the Online Sorting Problem
by: Azar, Yossi, et al.
Published: (2025)

KD-Club: An Efficient Exact Algorithm with New Coloring-based Upper Bound for the Maximum k-Defective Clique Problem
by: Jin, Mingming, et al.
Published: (2023)