Driven by recent technical advances, vehicle-based transportation systems in intralogistics are currently shifting from automated guided vehicles (AGVs) to autonomous mobile robots (AMRs). Unlike AGVs, AMRs are not bound to a physical or virtual track and autonomously determine their movements. While the increase in freedom for routing leads to improvements in terms of system flexibility and scalability, it also poses new challenges in terms of coordination and thus the high-performance routing behavior of an entire fleet. Accepted and widely used algorithms in the AGV field are often barely applicable to large fleets of free-ranging AMRs, while typical algorithms from the field of mobile robotics usually focus on different objectives.
This thesis presents a novel concept for determining global routes, the so-called lanemap, that enables the synchronized movements of multiple free-ranging vehicles in arbitrary layouts without increasing calculation effort during online operations. The basic idea consists in creating a lanemap offline that provides the AMRs with a set of suggested global lanes from various starting positions to different destinations. On the one hand, the application of a lanemap lowers each AMRs’ individual degree of freedom. However, coordinating lanes sensibly beforehand enables short travel distances as well as a low probability of routing conflicts, which improves the performance of the entire AMR fleet on the other hand. Since the lanemap only provides an offline calculated global route as suggestion, the concept can be combined with any established online approach, such as a local conflict avoidance/resolution approach, or with in-depth coordination of all vehicle movements.
This thesis presents a theoretical mathematical model and a practically applicable heuristic approach for the creation of a lanemap. As proof of concept, simulation experiments show that the heuristic is generally capable of creating lanemaps for all different kinds of layouts. Furthermore, the concept allows for the determination of customized routes for a specific fleet size and an anticipated transportation demand. Therefore, once system requirements are known, a beneficial set of lanemaps for typical constellations can be calculated in advance and integrated into routing as needed.
| Identifer | oai:union.ndltd.org:DRESDEN/oai:qucosa:de:qucosa:91095 |
| Date | 03 May 2024 |
| Creators | Reith, Karl-Benedikt |
| Contributors | Schmidt, Thorsten, Fottner, Johannes, Technische Universität Dresden |
| Source Sets | Hochschulschriftenserver (HSSS) der SLUB Dresden |
| Language | English |
| Detected Language | English |
| Type | info:eu-repo/semantics/publishedVersion, doc-type:doctoralThesis, info:eu-repo/semantics/doctoralThesis, doc-type:Text |
| Rights | info:eu-repo/semantics/openAccess |
Page generated in 0.0025 seconds