Abstract
This paper presents Multi-State Real-Time Bidirectional Search (MSRTBS), a method that improves the efficiency of the heuristic search algorithm for finding approximate solutions. Real-Time A* (RTA*) is a representative heuristic search algorithm for finding approximate solutions. The Multi-State Commitment (MSC) method was introduced into RTA* and dramatically improved the performance in problems such as the N-puzzle. As well, Real-Time Bidirectional Search (RTBS) also improved RTA* by changing a unidirectional search into a bidirectional one. This paper proposed a method that introduces MSC into RTBS. The experimental results showed that compared with RTBS and MSC our proposed method, MSRTBS, improved executed time and solution quality in the N-Puzzle.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Transactions of the Japanese Society for Artificial Intelligence
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
