Path determination and collision avoidance simulation software for factory work areas

Given a square grid, several obstacles, and a pair of start and stop points, an algorithm to search for a path between the points is presented. This is shown by combining two popular tree-search/maze-solving algorithms and implementing them in a macro level simulation. Likewise, a collision-avoidanc...

Full description

Saved in:
Bibliographic Details
Main Authors: Cruz, Jose Alfonso R., Manas, Celina H., Sicat, Roman V., Sison, Henry James M.
Format: text
Language:English
Published: Animo Repository 1994
Subjects:
Online Access:https://animorepository.dlsu.edu.ph/etd_bachelors/6644
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: De La Salle University
Language: English
Description
Summary:Given a square grid, several obstacles, and a pair of start and stop points, an algorithm to search for a path between the points is presented. This is shown by combining two popular tree-search/maze-solving algorithms and implementing them in a macro level simulation. Likewise, a collision-avoidance scheme is formulated by simulating on-board sensing, a technique used by AGVs. As a probable application area, it connects points in a user defined space or factory layout usually containing a generous number of rectangular obstacles, some of which may even be moving. Three simulated Autonomous Guided Vehicles (AGVs) then illustrate the effects of obstacle placements to help factory layout planners visualize their proposed floorplans.