The Experts below are selected from a list of 18021 Experts worldwide ranked by ideXlab platform
Frank Van Ham - One of the best experts on this subject based on the ideXlab platform.
-
Interactive visualization of large State Spaces
International Journal on Software Tools for Technology Transfer, 2005Co-Authors: Jan Friso Groote, Frank Van HamAbstract:Insight into the global structure of a State Space is of great help in the analysis of the underlying process. We advocate the use of visualization for this purpose and present a method to visualize the structure of very large State Spaces with millions of nodes. The method uses a clustering based on an equivalence relation to obtain a simplified representation, which is used as a backbone for the display of the Entire State Space. With this visualization we are able to answer questions about the global structure of a State Space that cannot easily be answered by conventional methods. We show this by presenting a number of visualizations of real-world protocols .
-
TACAS - Large State Space visualization
Tools and Algorithms for the Construction and Analysis of Systems, 2003Co-Authors: Jan Friso Groote, Frank Van HamAbstract:Insight in the global structure of a State Space is of great help in the analysis of the underlying process. We present a tool to visualize the structure of very large State Spaces. It uses a clustering method to obtain a simplified representation, which is used as a backbone for the display of the Entire State Space. With this tool we are able to answer questions about the global structure of a State Space that cannot easily be answered by conventional methods. We show this by presenting a number of visualizations of real-world protocols.
Jan Friso Groote - One of the best experts on this subject based on the ideXlab platform.
-
Interactive visualization of large State Spaces
International Journal on Software Tools for Technology Transfer, 2005Co-Authors: Jan Friso Groote, Frank Van HamAbstract:Insight into the global structure of a State Space is of great help in the analysis of the underlying process. We advocate the use of visualization for this purpose and present a method to visualize the structure of very large State Spaces with millions of nodes. The method uses a clustering based on an equivalence relation to obtain a simplified representation, which is used as a backbone for the display of the Entire State Space. With this visualization we are able to answer questions about the global structure of a State Space that cannot easily be answered by conventional methods. We show this by presenting a number of visualizations of real-world protocols .
-
TACAS - Large State Space visualization
Tools and Algorithms for the Construction and Analysis of Systems, 2003Co-Authors: Jan Friso Groote, Frank Van HamAbstract:Insight in the global structure of a State Space is of great help in the analysis of the underlying process. We present a tool to visualize the structure of very large State Spaces. It uses a clustering method to obtain a simplified representation, which is used as a backbone for the display of the Entire State Space. With this tool we are able to answer questions about the global structure of a State Space that cannot easily be answered by conventional methods. We show this by presenting a number of visualizations of real-world protocols.
-
State Space visualization
2002Co-Authors: Jan Friso Groote, Van Fjj Frank HamAbstract:Insight in the global structure of a State Space is of great help in the analysis of the underlying process. We advocate the use of visualization for this purpose and present a new method to visualize the structure of very large State Spaces. The method uses a clustering method to obtain a simplified representation, which is used as a backbone for the display of the Entire State Space. With this visualization we are able to answer questions about the global structure of a State Space that cannot easily be answered by conventional methods. We show this by presenting a number of visualizations of real-world protocols.
Shlomo Zilberstein - One of the best experts on this subject based on the ideXlab platform.
-
LAO: a heuristic search algorithm that finds solutions with loops
Artificial Intelligence, 2001Co-Authors: Eric A. Hansen, Shlomo ZilbersteinAbstract:Classic heuristic search algorithms can find solutions that take the form of a simple path (A*), a tree, or an acyclic graph (AO*). In this paper, we describe a novel generalization of heuristic search, called LAO*, that can find solutions with loops. We show that LAO* can be used to solve Markov decision problems and that it shares the advantage heuristic search has over dynamic programming for other classes of problems. Given a start State, it can find an optimal solution without evaluating the Entire State Space. 2001 Elsevier Science B.V. All rights reserved.
-
LAO∗: A heuristic search algorithm that finds solutions with loops
Artificial Intelligence, 2001Co-Authors: Eric A. Hansen, Shlomo ZilbersteinAbstract:AbstractClassic heuristic search algorithms can find solutions that take the form of a simple path (A∗), a tree, or an acyclic graph (AO∗). In this paper, we describe a novel generalization of heuristic search, called LAO∗, that can find solutions with loops. We show that LAO∗ can be used to solve Markov decision problems and that it shares the advantage heuristic search has over dynamic programming for other classes of problems. Given a start State, it can find an optimal solution without evaluating the Entire State Space
-
AAAI/IAAI - Heuristic search in cyclic AND/OR graphs
1998Co-Authors: Eric A. Hansen, Shlomo ZilbersteinAbstract:Heuristic search algorithms can find solutions that take the form of a simple path (A*), a tree or an acyclic graph (AO*). We present a novel generalization of heuristic search (called LAO*) that can find solutions with loops, that is, solutions that take the form of a cyclic graph. We show that it can be used to solve Markov decision problems without evaluating the Entire State Space, giving it an advantage over dynamic-programming algorithms such as policy iteration and value iteration as an approach to stochastic planning.
Richard St-denis - One of the best experts on this subject based on the ideXlab platform.
-
ATVA - Synthesis of State Feedback Controllers for Parameterized Discrete Event Systems
Automated Technology for Verification and Analysis, 2004Co-Authors: Hans Bherer, Jules Desharnais, Marc Frappier, Richard St-denisAbstract:We consider the State feedback control of parameterized discrete event systems consisting of N similar processes. The basic idea underlying the proposed approach is to exploit both the symmetry of the system to be controlled and the symmetry of the control specification in order to avoid the exploration of the Entire State Space. Under some assumptions, it is shown that it suffices i) to synthesize off-line a control policy for a small value of the parameter N, and ii) to infer on-line acontrol policy for a larger system, consisting of an arbitrarily large number of processes, from its current State and the previously calculated control policy. Soundness of the new synthesis method is also established.
-
Synthesis of State Feedback Controllers for Parameterized Discrete Event Systems Under Partial Observation
Proceedings of the 44th IEEE Conference on Decision and Control, 1Co-Authors: Hans Bherer, Jules Desharnais, Richard St-denisAbstract:This paper considers the State feedback control of parameterized discrete event systems consisting of N similar processes for the problem of maintaining a predicate on the State Space of the system invariant under partial observation. The basic idea underlying the proposed approach consists in exploiting the symmetry of the system to be controlled, the symmetry of the mask, and the symmetry of the control specification, in order to avoid the exploration of the Entire State Space. It is shown that it suffices i) to synthesize off-line a controller for a small value (n 0 ) of the parameter N; and ii) to infer on-line the control for a larger system, consisting of an arbitrarily large number (n with n 0 ≤ n) of processes, from its current State and the small controller.
Sergey V. Drakunov - One of the best experts on this subject based on the ideXlab platform.
-
Sliding mode control of the systems with uncertain direction of control vector
Proceedings of 32nd IEEE Conference on Decision and Control, 1993Co-Authors: Sergey V. DrakunovAbstract:The sliding mode control approach is used for a class of nonlinear systems x/spl dot/=f(t,x)+B(t,x)u with uncertain matrix B. The control design is based on the partition of the extended system State Space onto the cells with fixed control vector inside each cell. That results in multiple stable equilibriums for the extended system. In general, these points are different for different values of B. Each equilibrium corresponds to the stability of the origin for the given system, If areas of attraction for the multiple stability points covers the Entire State Space the proposed control allows to stabilize the system even if the direction of the actuation is unknown. >