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...
محفوظ في:
المؤلفون الرئيسيون: | , , , |
---|---|
التنسيق: | text |
اللغة: | English |
منشور في: |
Animo Repository
1994
|
الموضوعات: | |
الوصول للمادة أونلاين: | https://animorepository.dlsu.edu.ph/etd_bachelors/6644 |
الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
المؤسسة: | De La Salle University |
اللغة: | English |
الملخص: | 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. |
---|