Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Engineering
Practical Considerations And Applications For Autonomous Robot Swarms, Rory Alan Hector
Practical Considerations And Applications For Autonomous Robot Swarms, Rory Alan Hector
LSU Doctoral Dissertations
In recent years, the study of autonomous entities such as unmanned vehicles has begun to revolutionize both military and civilian devices. One important research focus of autonomous entities has been coordination problems for autonomous robot swarms. Traditionally, robot models are used for algorithms that account for the minimum specifications needed to operate the swarm. However, these theoretical models also gloss over important practical details. Some of these details, such as time, have been considered before (as epochs of execution). In this dissertation, we examine these details in the context of several problems and introduce new performance measures to capture practical …
Offline And Online Variants Of The Traveling Salesman Problem, John Ebenezer Augustine
Offline And Online Variants Of The Traveling Salesman Problem, John Ebenezer Augustine
LSU Master's Theses
In this thesis, we study several well-motivated variants of the Traveling Salesman Problem (TSP). First, we consider makespan minimization for vehicle scheduling problems on trees with release and handling times. 2-approximation algorithms were known for several variants of the single vehicle problem on a path. A 3/2-approximation algorithm was known for the single vehicle problem on a path where there is a fixed starting point and the vehicle must return to the starting point upon completion. Karuno, Nagamochi and Ibaraki give a 2-approximation algorithm for the single vehicle problem on trees. We develop a Polynomial Time Approximation Scheme (PTAS) for …