The traveling salesman problem (TSP), a typical non‐deterministic polynomial (NP) hard
problem, has been used in many engineering applications. Genetic algorithms are useful for …

This paper addresses a MinMax variant of the Dubins multiple traveling salesman problem
(mTSP). This routing problem arises naturally in mission planning applications involving …

Multi-goal curvature-constrained planning such as the Dubins Traveling Salesman Problem
(DTSP) combines NP-hard combinatorial routing with continuous optimization to determine …

Abstract [eng] The study presents the Half Max Insertion Heuristic (HMIH) as a novel
approach to solving the Travelling Salesman Problem (TSP). The goal is to outperform …

To automate the welding of multiple industrial parts that are too large for conveyor belts, we
designed a mobile manipulator to perform welding around large parts and move between …

This study investigated the computational effect of a Convex Hull subtour on the Nearest
Neighbour Heuristic. Convex hull subtour has been shown to theoretically degrade the worst …

For a given set of orbits, the Orbiting Dubins Traveling Salesman Problem (ODTSP) involves
finding Dubins tour that is tangential to each orbit at some point. We consider a shortest Arc …

In this study, the reconnaissance and confirmation task planning of multiple fixed-wing
unmanned aerial vehicles (UAV) with specific payloads, which is an NP-hard problem with …

This paper presents a variant of the Traveling Salesman Problem (TSP) with nonholonomic
constraints and dynamic obstacles, with optimal control applications in the mining industry …

Many robotic exploration and surveillance applications can be modeled as a single-robot
Euclidean traveling salesman problem (TSP). However, the robot in the real-world is usually …