Abstract
The authors present research in plan recognition which enables systems to be built which will perform plan recognition with plan libraries that are incompletely specified and later updated by a user. The algorithms build on Kautz's model of plan recognition, but introduce an assumption-based truth maintenance system to update the set of candidate plans, adjusting to the new library information. Plan recognition is achieved via local repair driven by the changes to the library, rather than by complete recalculation from the new library. This approach is considered desirable in practical applications where plan libraries may be very large. A graphical tool is presented which allows a user to specify a plan library, observations and updates, and displays candidate plans to the user as output. This tool is in the development stage. This work addresses the problems faced by users in application areas which employ plan recognition, allowing for specifications and modifications to be supplied in stages with plan recognition continuing at minimal repair cost. >
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 callDisclaimer: 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.
