논문 상세보기
Research of the Efficient Grid-based Path Planning for Large-Scale Delivery in the Urban Environment KCI 등재
광역 도심 배송을 위한 Efficient Grid 기반 경로 계획 알고리즘 연구
pp.147-154
This study focuses on the path planning algorithm for large-scale autonomous delivery using drones and robots in urban environments. When generating delivery routes in urban environments, it is essential that avoid obstacles such as buildings, parking lots, or any other obstacles that could cause property damage. A commonly used method for obstacle avoidance is the grid-based A* algorithm. However, in large-scale urban environments, it is not feasible to set the resolution of the grid too high. If the grid cells are not sufficiently small during path planning, inefficient paths might be generated when avoiding obstacles, and smaller obstacles might be overlooked. To solve these issues, this study proposes a method that initially creates a low-resolution wide-area grid and then progressively reduces the grid cell size in areas containing registered obstacles to maintain real-time efficiency in generating paths. To implement this, obstacles in the operational area must first be registered on the map. When obstacle information is updated, the cells containing obstacles are processed as a primary subdivision, and cells closer to the obstacles are processed as a secondary subdivision. This approach is validated in a simulation environment and compared with the previous research according to the computing time and the path distance.
2. 도심형 장애물 등록
2.1 장애물 등록
2.2 안전 경계 설정
3. Efficient Grid 경로 생성
3.1 Global Index Mapping
3.2 Inner Grid Index Mapping
3.3 단계별 Grid 생성
4. 시뮬레이션 분석
4.1 시뮬레이션 시나리오
4.2 시뮬레이션 결과 비교
5. 결 론
Acknowledgement
References
