2022 26th International Conference on Methods and Models in Automation and Robotics (MMAR) 2022
DOI: 10.1109/mmar55195.2022.9874325
|View full text |Cite
|
Sign up to set email alerts
|

Simulated Annealing-based Energy Efficient Route Planning for Urban Service Robots

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
1
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
4

Relationship

2
2

Authors

Journals

citations
Cited by 4 publications
(5 citation statements)
references
References 27 publications
0
1
0
Order By: Relevance
“…The first one is the Simulated Annealing (SA) algorithm, which involves a metaheuristic, modelled after the cooling process in metallurgy, intended to "guide" a heuristic route optimization algorithm [28]. The algorithm starts with an initial route created using a nearest neighbor or random node order algorithm [29], which is then iteratively optimized (see previous publication [29] for more information). Furthermore, the Knapsack problem (KSP) algorithm was implemented for a single as well as a swarm of MARBLE robots.…”
Section: Figure 1: Marble Performing Its Functionalities During a Tes...mentioning
confidence: 99%
See 2 more Smart Citations
“…The first one is the Simulated Annealing (SA) algorithm, which involves a metaheuristic, modelled after the cooling process in metallurgy, intended to "guide" a heuristic route optimization algorithm [28]. The algorithm starts with an initial route created using a nearest neighbor or random node order algorithm [29], which is then iteratively optimized (see previous publication [29] for more information). Furthermore, the Knapsack problem (KSP) algorithm was implemented for a single as well as a swarm of MARBLE robots.…”
Section: Figure 1: Marble Performing Its Functionalities During a Tes...mentioning
confidence: 99%
“…Similarly, MARBLE has no previous knowledge about the filling levels of the LBs. Preceding works have provided assistance in route planning by developing simulated routes for emptying the LBs with the least possible energy consumption [18]- [20]. These routes are till now either based on the assumption that the dustbins will be 50% full [18], [20] or that they will be provided with assistance from future smart LBs [19].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…For SEA Monbijou Park, Berlin, with 51 LBs, a management system framework was established, with a physical layer defining robot, MS, and SEA characteristics, and a platform layer using algorithms to optimize routes for minimal energy consumption and operation time based on LB positions and 50% filling levels (Bräutigam et al, 2022). Routes considered MARBLE's limited garbage storing capacity.…”
Section: Phase 3: Operation Management System As Servicementioning
confidence: 99%
“…Optimized route planning means the shortest path and least possible energy consumption for the overall waste-management service [14]. The route-planning algorithm can be solved as a vehicle routing problem using meta-heuristics like simulated annealing for single [15] and multiple actors [8]. The knapsack problem is a combinatorial optimization problem related to capacity constraints; it focuses on optimizing the weight of items in a specific sack.…”
Section: State Of the Artmentioning
confidence: 99%