Abstract
This chapter describes extensions to the state set representation used throughout this dissertation, demonstrating that more computationally efficient domain-specific representations can be used to effect interleaving as described in this thesis. Section 8.1 describes the type of extensions we allow. Section 8.2 describes two specific domain-specific representations, demonstrating implementations of our belief update functions in those representations to enable the use of algorithms presented in this dissertation.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media New York
About this chapter
Cite this chapter
Nourbakhsh, I.R. (1997). Generalizing Beyond State Sets. In: Interleaving Planning and Execution for Autonomous Robots. The Springer International Series in Engineering and Computer Science, vol 385. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-6317-4_8
Download citation
DOI: https://doi.org/10.1007/978-1-4615-6317-4_8
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7900-3
Online ISBN: 978-1-4615-6317-4
eBook Packages: Springer Book Archive