Sökning: "mTSP"

Hittade 2 avhandlingar innehållade ordet mTSP.

1. 1. Optimizing and Approximating Algorithms for the Single and Multiple Agent Precedence Constrained Generalized Traveling Salesman Problem

   Författare :Raad Salman; Göteborgs universitet; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; PCGmTSP; GTSP; SOP; mTSP; branch and bound; asymmetric generalized multiple traveling salesman problem; VRP; PCGTSP; dynamic programming; sequential ordering problem; vehicle routing problem; ant colony optimization; metaheuristic local search heuristic; precedence constraints; edge exchange; ant colony optimization;

   Sammanfattning : In the planning phases of automated manufacturing, generating efficient programs for robot stations is a crucial problem which needs to be solved. One aspect of the programming is the optimization of task sequences, such as series of welds or measuring points, so that the cycle time is minimized. LÄS MER

3. 2. Synergistic Strategies in Multi-Robot Systems: Exploring Task Assignment and Multi-Agent Pathfinding

   Författare :Yifan Bai; George Nikolakopoulos; Tomi Westerlund; Luleå tekniska universitet; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Autonomous robots; Multi-robot systems; Task assignment; Multi-agent path-finding; Robotics and Artificial Intelligence; Robotik och artificiell intelligens;

   Sammanfattning : Robots are increasingly utilized in industry for their capability to perform repetitive,complex tasks in environments unsuitable for humans. This surge in robotic applicationshas spurred research into Multi-Robot Systems (MRS), which aim to tackle complex tasksrequiring collaboration among multiple robots, thereby boosting overall efficiency. LÄS MER