인문학
사회과학
자연과학
공학
의약학
농수해양학
예술체육학
복합학
DBpia AI
AI 에이전트
AI 아이디어
AI 리더
AI 뷰어
Citeasy
크롬 서지관리 다운로드
지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 자료유형
- 학술저널
- 저자정보
- 저널정보
- Korean Society for Precision Engineering Journal of the Korean Society for Precision Engineering Journal of the Korean Society for Precision Engineering Vol.43 No.4
- 발행연도
- 2026.4
- 수록면
- 317 - 324 (8page)
이용수
초록· 키워드
Multi-Agent Path Finding (MAPF) is an algorithm designed to identify collision-free paths for multiple agents, commonly used in fields like robotics and drone navigation. Conflict-Based Search with Continuous Time (CCBS) is particularly beneficial for real-world applications due to its capability to find paths in continuous time; however, it often experiences lengthy computation times. Although techniques such as prioritizing conflicts (PC), disjoint splitting (DS), and high-level heuristics have been implemented to reduce these times, challenges remain. To address these issues, this paper introduces methods to improve space utilization by calculating agent congestion. By optimizing space usage, we can identify paths that avoid potential collisions, even when those paths share the same cost. We propose enhancements to high-level heuristics, conflict prioritization, and low-level heuristics, as well as a method for calculating congestion in continuous time. These improvements lead to a reduction in agent collisions and a decrease in high-level expansions, resulting in a 30% increase in computational success rates compared to the existing CCBS. Incorporating space utilization into the search process significantly enhances MAPF performance.
#Multi-agent path finding (다중 에이전트 경로 탐색)
#Collision based search (충돌 기반 탐색)
#Path planning (경로 탐색)
#Robot navigation (로봇 네비게이션)
상세정보 수정요청해당 페이지 내 제목·저자·목차·페이지정보가 잘못된 경우 알려주세요!
목차
- 1. Introduction
- 2. Theoretical Background
- 3. Methodology
- 4. Experiments
- 5. Conclusion
- REFERENCES
참고문헌
참고문헌 신청최근 본 자료
