This thesis is concerned with the robots' motion planning problem. In particular it is focused on the path planning and motion planning for Autonomously Guided Vehicles (AGVs) in well-structured, two-dimensional static and dynamic environments. Two algorithms are proposed for solving the aforementioned problems. The first algorithm establishes the shortest collision-semi-free path for an AGV from its start point to its goal point, in a two-dimensional static environment populated by simple polygonal obstacles. This algorithm constructs and searches a reduced visibility graph, within the AGV's configuration space, using heuristic information about the problem domain. The second algorithm establishes the time minimal collision-semi-free motion for an AGV, from its start point to is goal point, in a two-dimensional dynamic environment populated by simple polygonal obstacles. This algorithm considers the AGV's spacetime configuration space, thus reducing the dynamic motion planning problem to the static path planning problem. A reduced visibility graph is then constructed and searched using information about the problem domain, in the AGV's space-time configuration space in order to establish the time-minimal motion between the AGV's start and goal configurations. The latter algorithm is extended to solve more complicated instances of the dynamic motion planning problem, where the AGV's environment is populated by obstacles, which change their size as well as their position over time and obstacles, which have piecewise linear motion. The proposed algorithms can be used to efficiently and safely navigate AGVs in well structured environments. For example, for the navigation of an AGV, in industrial environments, where it operates as part of the manufacturing process or in chemical and nuclear plants, where the hostile environment is inaccessible to humans. The main contributions in this thesis are, the systematic study of the V*GRAPH algorithm and identification of its methodic and algorithmic deficiencies; recommendation of corrections and further improvements on the V* GRAPH algorithm, which in turn lead to the proposition of the V*MECHA algorithm for robot path planning; proposition of the D*MECHA algorithm for motion planning in dynamic environments; extension to the D*MECHA algorithm to solve more complicated instances of the dynamic robot motion planning problem; discussion of formal proofs of the proposed algorithms' correctness and optimality and critical comparisons with existing similar algorithms for solving the motion planning problem.
| Identifer | oai:union.ndltd.org:bl.uk/oai:ethos.bl.uk:749645 |
| Date | January 2001 |
| Creators | Diamantopoulos, Anastasios |
| Publisher | University of South Wales |
| Source Sets | Ethos UK |
| Detected Language | English |
| Type | Electronic Thesis or Dissertation |
| Source | https://pure.southwales.ac.uk/en/studentthesis/a-reduced-visibility-graph-approach-for-motion-planning-of-autonomously-guided-vehicles(3f368020-0a83-42e5-ba83-b4a4a6257bc2).html |
Page generated in 0.0017 seconds