Show simple item record

Planning and Resource Allocation for Hard Real-time, Fault-Tolerant Plan Execution

dc.contributor.authorAtkins, Ella M.en_US
dc.contributor.authorAbdelzaher, Tarek F.en_US
dc.contributor.authorShin, Kang G.en_US
dc.contributor.authorDurfee, Edmund H.en_US
dc.date.accessioned2006-09-11T14:09:24Z
dc.date.available2006-09-11T14:09:24Z
dc.date.issued2001-03en_US
dc.identifier.citationAtkins, Ella M.; Abdelzaher, Tarek F.; Shin, Kang G.; Durfee, Edmund H.; (2001). "Planning and Resource Allocation for Hard Real-time, Fault-Tolerant Plan Execution." Autonomous Agents and Multi-Agent Systems 4 (1-2): 57-78. <http://hdl.handle.net/2027.42/44010>en_US
dc.identifier.issn1387-2532en_US
dc.identifier.issn1573-7454en_US
dc.identifier.urihttps://hdl.handle.net/2027.42/44010
dc.description.abstractWe describe the interface between a real-time resource allocation system with an AI planner in order to create fault-tolerant plans that are guaranteed to execute in hard real-time. The planner specifies the task set and all execution deadlines required to ensure system safety, then the resource utilization. A new interface module combines information from planning and resource allocation to enforce development of plans feasible for execution during a variety of internal system faults. Plans that over-utilize any system resource trigger feedback to the planner, which then searches for an alternate plan. A valid plan for each specified fault, including the nominal no-fault situation, is stored in a plan cache for subsequent real-time execution. We situate this work in the context of CIRCA, the Cooperative Intelligent Real-time Control Architecture, which focuses on developing and scheduling plans that make hard real-time safety guarantees, and provide an example of an autonomous aircraft agent to illustrate how our planner-resource allocation interface improves CIRCA performance.en_US
dc.format.extent209819 bytes
dc.format.extent3115 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypetext/plain
dc.language.isoen_US
dc.publisherKluwer Academic Publishers; Springer Science+Business Mediaen_US
dc.subject.otherComputer Scienceen_US
dc.subject.otherSoftware Engineering/Programming and Operating Systemsen_US
dc.subject.otherData Structures, Cryptology and Information Theoryen_US
dc.subject.otherUser Interfaces and Human Computer Interactionen_US
dc.subject.otherArtificial Intelligence (Incl. Robotics)en_US
dc.subject.otherAI Architecturesen_US
dc.subject.otherPlanningen_US
dc.subject.otherReal-time Schedulingen_US
dc.subject.otherFault-toleranceen_US
dc.titlePlanning and Resource Allocation for Hard Real-time, Fault-Tolerant Plan Executionen_US
dc.typeArticleen_US
dc.subject.hlbsecondlevelComputer Scienceen_US
dc.subject.hlbsecondlevelPhilosophyen_US
dc.subject.hlbtoplevelHumanitiesen_US
dc.subject.hlbtoplevelEngineeringen_US
dc.description.peerreviewedPeer Revieweden_US
dc.contributor.affiliationumUniversity of Michigan, USAen_US
dc.contributor.affiliationumUniversity of Michigan, USAen_US
dc.contributor.affiliationotherUniversity of Maryland, USAen_US
dc.contributor.affiliationotherUniversity of Virginia, USAen_US
dc.contributor.affiliationumcampusAnn Arboren_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/44010/1/10458_2004_Article_318111.pdfen_US
dc.identifier.doihttp://dx.doi.org/10.1023/A:1010066729351en_US
dc.identifier.sourceAutonomous Agents and Multi-Agent Systemsen_US
dc.owningcollnameInterdisciplinary and Peer-Reviewed


Files in this item

Show simple item record

Remediation of Harmful Language

The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.

Accessibility

If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.