메뉴 건너뛰기
.. 내서재 .. 알림
소속 기관/학교 인증
인증하면 논문, 학술자료 등을  무료로 열람할 수 있어요.
한국대학교, 누리자동차, 시립도서관 등 나의 기관을 확인해보세요
(국내 대학 90% 이상 구독 중)
로그인 회원가입 고객센터 ENG
주제분류

추천
검색
질문

논문 기본 정보

자료유형
학술대회자료
저자정보
Joonmyun Cho (Electronics and Telecommunications Research Institute) Hyonyoung Han (Electronics and Telecommunications Research Institute)
저널정보
제어로봇시스템학회 제어로봇시스템학회 국제학술대회 논문집 ICCAS 2023
발행연도
2023.10
수록면
1,850 - 1,853 (4page)

이용수

표지
📌
연구주제
📖
연구배경
🔬
연구방법
🏆
연구결과
AI에게 요청하기
추천
검색
질문

초록· 키워드

오류제보하기
There is a growing interest in automated planning (also known as AI planning) as a promising technique for autonomous agents, such as robots, to achieve a given goal (mission) by devising their own action plans. In AI planning as heuristic search, informative and fast heuristics are crucial for performance. Recently, AI planning systems using stateof-the-art heuristics have made remarkable progress compared to the past, mostly achieved by using a combination of multiple heuristics. In this paper, we propose a novel search heuristic called the integrity heuristic, which is based on the popular FF heuristic. The integrity heuristic is used in conjunction with the FF heuristic through a tie-breaking mechanism to improve the performance of planners. In this paper, we present the theoretical grounds for defining the integrity of states and empirically verify our integrity heuristic by implementing a greedy best-first search algorithm using the FF heuristic and our integrity heuristic, and show that the proposed integrity heuristic leads to performance improvement.

목차

Abstract
1. INTRODUCTION
2. INTEGRITY HEURISTIC FOR CLASSICAL PLANNING
3. EXPLOITING INTEGRITY HEURISTIC IN SEARCH
4. EXPERIMENTAL EVALUATION
5. RELATED WORK
6. CONCLUSIONS AND FUTURE WORK
REFERENCES

참고문헌 (0)

참고문헌 신청

함께 읽어보면 좋을 논문

논문 유사도에 따라 DBpia 가 추천하는 논문입니다. 함께 보면 좋을 연관 논문을 확인해보세요!

이 논문의 저자 정보

이 논문과 함께 이용한 논문

최근 본 자료

전체보기

댓글(0)

0

UCI(KEPA) : I410-151-24-02-088266571