The logical complexity of control problems formulated in COCOLOG

Autor:	Yuan-Jun Wei, Peter E. Caines
Rok vydání:	2002
Předmět:	Finite-state machine media_common.quotation_subject Markov process Algebra symbols.namesake Fragment (logic) symbols Order (group theory) Simplicity State (computer science) Intelligent control Control (linguistics) Algorithm Mathematics media_common
Zdroj:	Proceedings of 32nd IEEE Conference on Decision and Control.
DOI:	10.1109/cdc.1993.325608
Popis:	The COCOLOG system is a partially ordered family of first order logical theories that describe the controlled evolution of the state of a given partially observed finite machine M. Following the review of the general COCOLOG system and its Markovain fragment system, a multi-complexity measurement called joint is defined and further a partial order simplicity is introduced. Finally, some comparisons among various control problems have been given. >
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::7e00f1f3b10b5b04a9e06a9883bcc4f3 https://doi.org/10.1109/cdc.1993.325608 Zobrazit plný text záznamu