In this paper, an optimal control design scheme is proposed for continuous-time linear stochastic systems with unknown dynamics. Both signal-dependent noise and additive noise are considered. A non-model based optimal...
详细信息
ISBN:
(纸本)9781467374439
In this paper, an optimal control design scheme is proposed for continuous-time linear stochastic systems with unknown dynamics. Both signal-dependent noise and additive noise are considered. A non-model based optimal control design methodology is employed to iteratively update the control policy online by using the system state and input information. A new adaptive dynamic programming algorithm is developed, and the convergence result for the proposed methods is presented. The effectiveness of the obtained method is also illustrated by a practical simulation example of 2-DOF vehicle suspension control system.
作者：
Tao BIANZhong-Ping JIANGControl and Networks Lab
Department of Electrical and Computer Engineering Tandon School of Engineering New York University 5 Metrotech Center Brooklyn NY 11201 U.S.A.
This paper presents new results on the robust global stabilization and the gain assignment problems for stochastic nonlinear systems. Three stochastic nonlinear control design schemes are developed. Furthermore, a new...
详细信息
This paper presents new results on the robust global stabilization and the gain assignment problems for stochastic nonlinear systems. Three stochastic nonlinear control design schemes are developed. Furthermore, a new stochastic gain assignment method is developed for a class of uncertain interconnected stochastic nonlinear systems. This method can be combined with the nonlinear small-gain theorem to design partial-state feedback controllers for stochastic nonlinear systems. Two numerical examples are given to illustrate the effectiveness of the proposed methodology.
Compositionality can be a helpful paradigm for coping with the complexity of large embedded systems with real-time constraints. This article exploits state-less assume/guarantee real-time interfaces extended by compon...
详细信息
Location information about mobile devices can reveal movement patterns of people wearing them. We present a crosstechnology approach to track Wi-Fi enabled smartphones using a ZigBee sensor network. Implementing such ...
详细信息
ISBN:
(纸本)9781450320276
Location information about mobile devices can reveal movement patterns of people wearing them. We present a crosstechnology approach to track Wi-Fi enabled smartphones using a ZigBee sensor network. Implementing such a system on resource constrained low-power sensor nodes requires means to eficiently process signal strength measurements. We propose a new method to recognize Wi-Fi probe requests on devices that are unable to decode Wi-Fi packets. Initial experiments on a testbed show that it is possible to localize unmodified phones within a building using signal strength measurements.
In this paper, we classified existing address autoconfiguration schemes based on two communication models: centralized and distributed schemes. We defined performance metrics and evaluated four existing address autoco...
详细信息
ISBN:
(纸本)1932415408
In this paper, we classified existing address autoconfiguration schemes based on two communication models: centralized and distributed schemes. We defined performance metrics and evaluated four existing address autoconfiguration schemes. We suggested requirements for an address autoconfiguration scheme.
Distributed machine learning utilization in the metaverse exposes many potential benefits. However, the combination of these advanced technologies raises significant privacy concerns due to the potential exploitation ...
详细信息
In a multiobjective setting, evolutionary algorithms can be used to generate a set of compromise solutions. This makes decision making easier for the user as he has alternative solutions at hand which he can directly ...
详细信息
ISBN:
(纸本)9781605581309
In a multiobjective setting, evolutionary algorithms can be used to generate a set of compromise solutions. This makes decision making easier for the user as he has alternative solutions at hand which he can directly compare. However, if the number of solutions and the number of decision variables which define the solutions are large, such an analysis may be difficult and corresponding tools are desirable to support a human in separating relevant from irrelevant information. In this paper, we present a method to extract structural information from Pareto-set approximations which offers the possibility to present and visualize the trade-off surface in a compressed form. The main idea is to identify modules of decision variables that are strongly related to each other. Thereby, the set of decision variables can be reduced to a smaller number of significant modules. Furthermore, at the same time the solutions are grouped in a hierarchical manner according to their module similarity. Overall, the output is a dendrogram where the leaves are the solutions and the nodes are annotated with modules. As will be shown on knapsack problem instances and a network processor design application, this method can be highly useful to reveal hidden structures in compromise solution sets. Copyright 2008 ACM.
A fresh approach to detecting emphasised spoken words, where the concept of one-class classification is adopted, is investigated in this research work, such that a major difficulty - collecting a large amount of well-...
详细信息
MLS is a distributed location service to track the position of mobile nodes and to route messages between any two nodes. The lookup of nodes is achieved by searching in a hierarchy of pointers that each node maintains...
详细信息
ISBN:
(纸本)1595933689
MLS is a distributed location service to track the position of mobile nodes and to route messages between any two nodes. The lookup of nodes is achieved by searching in a hierarchy of pointers that each node maintains. We show that MLS has constant stretch for lookup requests. In contrast to previous work, we consider a concurrent setup where nodes are truly mobile and move even while messages are being routed towards them. We prove correctness and efficiency of MLS and determine the maximum speed at which the nodes might move, which is up to 1/15 of the routing speed. To the best of our knowledge, this is the first work that bounds the node speed, a necessity to prove the success of a lookup algorithm. We verified our theoretical results through extensive simulation and show that the average lookup stretch is around 6. Copyright 2006 ACM.
Design space exploration is introduced as one of the major tasks in embedded system design. After reviewing existing exploration methods at various layers of abstraction, a generic approach is described based on multi...
详细信息
暂无评论