Search

Many practical applications of signal processing require accurate determination of signal parameters from sensorarray measurements. Most estimation techniques are sensitive to errors in the array response model. Thus, reliable array calibration schemes are of great importance. A paradigm for generating an array model from noise corrupted calibration vectors is developed. The key idea is to use a local parametric model of the sensorresponses. The potential improvement using the suggested scheme is demonstrated on real data collected from a full-scale hydroacoustic array., NR 20140805

In this paper, we consider the problem of controlling multiple scalar systems through a limited capacity shared channel. Each system is affected by process noise and can be controlled by actuators with values in a fixed finite set. The control objective is to bound the evolution of the systems in specified sets (controlled invariance). Our goal is to find an optimal allocation of the shared communication resource to the different control activities and to identify correct choices for the design parameters. The paper provides fundamental conceptual tools to attack the design problem in the formal framework of an optimization problem. Namely, we give a feasibility criterion to decide whether a set of design parameters conforms with a control specification (i.e., with the controlled invariance of a specified set for each system). Moreover, we offer the explicit computation of the minimum bit rate necessary for the controlled invariance of a set, which is of utmost importance for solving the optimization problem., © 2004 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.QC 20120215

In this paper, we consider the problem of controlling multiple scalar systems through a limited capacity shared channel. Each system is affected by process noise and can be controlled by actuators with values in a fixed finite set. The control objective is to bound the evolution of the systems in specified sets (controlled invariance). Our goal is to find an optimal allocation of the shared communication resource to the different control activities and to identify correct choices for the design parameters. The paper provides fundamental conceptual tools to attack the design problem in the formal framework of an optimization problem. Namely, we give a feasibility criterion to decide whether a set of design parameters conforms with a control specification (i.e., with the controlled invariance of a specified set for each system). Moreover, we offer the explicit computation of the minimum bit rate necessary for the controlled invariance of a set, which is of utmost importance for solving the optimization problem., © 2004 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.QC 20120215

In this paper, we consider the problem of controlling multiple scalar systems through a limited capacity shared channel. Each system is affected by process noise and can be controlled by actuators with values in a fixed finite set. The control objective is to bound the evolution of the systems in specified sets (controlled invariance). Our goal is to find an optimal allocation of the shared communication resource to the different control activities and to identify correct choices for the design parameters. The paper provides fundamental conceptual tools to attack the design problem in the formal framework of an optimization problem. Namely, we give a feasibility criterion to decide whether a set of design parameters conforms with a control specification (i.e., with the controlled invariance of a specified set for each system). Moreover, we offer the explicit computation of the minimum bit rate necessary for the controlled invariance of a set, which is of utmost importance for solving the optimization problem., © 2004 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.QC 20120215

In this paper, we consider the problem of controlling multiple scalar systems through a limited capacity shared channel. Each system is affected by process noise and can be controlled by actuators with values in a fixed finite set. The control objective is to bound the evolution of the systems in specified sets (controlled invariance). Our goal is to find an optimal allocation of the shared communication resource to the different control activities and to identify correct choices for the design parameters. The paper provides fundamental conceptual tools to attack the design problem in the formal framework of an optimization problem. Namely, we give a feasibility criterion to decide whether a set of design parameters conforms with a control specification (i.e., with the controlled invariance of a specified set for each system). Moreover, we offer the explicit computation of the minimum bit rate necessary for the controlled invariance of a set, which is of utmost importance for solving the optimization problem., © 2004 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.QC 20120215

In this paper, we consider the problem of controlling multiple scalar systems through a limited capacity shared channel. Each system is affected by process noise and can be controlled by actuators with values in a fixed finite set. The control objective is to bound the evolution of the systems in specified sets (controlled invariance). Our goal is to find an optimal allocation of the shared communication resource to the different control activities and to identify correct choices for the design parameters. The paper provides fundamental conceptual tools to attack the design problem in the formal framework of an optimization problem. Namely, we give a feasibility criterion to decide whether a set of design parameters conforms with a control specification (i.e., with the controlled invariance of a specified set for each system). Moreover, we offer the explicit computation of the minimum bit rate necessary for the controlled invariance of a set, which is of utmost importance for solving the optimization problem., © 2004 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.QC 20120215

A new distributed coordination algorithm for multi-vehicle systems is presented in this paper. The algorithm combines a particular choice of navigation function with Voronoi partitions. This results not only in obstacle avoidance and motion to the goal, but also in a desirable geographical distribution of the vehicles. Our algorithm is decentralized in that each vehicle needs only to know the position of neighboring vehicles, but no other inter-vehicle communication or centralized control are required. The algorithm gives a natural priority to safety, goal convergence, and formation keeping, in that (1) collision avoidance is guaranteed under all circumstances, (2) the vehicles will move toward the goal as long as a given optimization problem is feasible, and (3) if prior criteria admit, the vehicles tend to a desirable lattice formation. These theoretical properties are discussed in the paper and the performance of the algorithm is illustrated in simulations with realistic models of twenty all-terrain vehicles. Planned experimental evaluation using customized miniature cars is also briefly described., © 2005 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. QC 20120220

A new distributed coordination algorithm for multi-vehicle systems is presented in this paper. The algorithm combines a particular choice of navigation function with Voronoi partitions. This results not only in obstacle avoidance and motion to the goal, but also in a desirable geographical distribution of the vehicles. Our algorithm is decentralized in that each vehicle needs only to know the position of neighboring vehicles, but no other inter-vehicle communication or centralized control are required. The algorithm gives a natural priority to safety, goal convergence, and formation keeping, in that (1) collision avoidance is guaranteed under all circumstances, (2) the vehicles will move toward the goal as long as a given optimization problem is feasible, and (3) if prior criteria admit, the vehicles tend to a desirable lattice formation. These theoretical properties are discussed in the paper and the performance of the algorithm is illustrated in simulations with realistic models of twenty all-terrain vehicles. Planned experimental evaluation using customized miniature cars is also briefly described., © 2005 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. QC 20120220

A new distributed coordination algorithm for multi-vehicle systems is presented in this paper. The algorithm combines a particular choice of navigation function with Voronoi partitions. This results not only in obstacle avoidance and motion to the goal, but also in a desirable geographical distribution of the vehicles. Our algorithm is decentralized in that each vehicle needs only to know the position of neighboring vehicles, but no other inter-vehicle communication or centralized control are required. The algorithm gives a natural priority to safety, goal convergence, and formation keeping, in that (1) collision avoidance is guaranteed under all circumstances, (2) the vehicles will move toward the goal as long as a given optimization problem is feasible, and (3) if prior criteria admit, the vehicles tend to a desirable lattice formation. These theoretical properties are discussed in the paper and the performance of the algorithm is illustrated in simulations with realistic models of twenty all-terrain vehicles. Planned experimental evaluation using customized miniature cars is also briefly described., © 2005 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. QC 20120220

A new distributed coordination algorithm for multi-vehicle systems is presented in this paper. The algorithm combines a particular choice of navigation function with Voronoi partitions. This results not only in obstacle avoidance and motion to the goal, but also in a desirable geographical distribution of the vehicles. Our algorithm is decentralized in that each vehicle needs only to know the position of neighboring vehicles, but no other inter-vehicle communication or centralized control are required. The algorithm gives a natural priority to safety, goal convergence, and formation keeping, in that (1) collision avoidance is guaranteed under all circumstances, (2) the vehicles will move toward the goal as long as a given optimization problem is feasible, and (3) if prior criteria admit, the vehicles tend to a desirable lattice formation. These theoretical properties are discussed in the paper and the performance of the algorithm is illustrated in simulations with realistic models of twenty all-terrain vehicles. Planned experimental evaluation using customized miniature cars is also briefly described., © 2005 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. QC 20120220

A new distributed coordination algorithm for multi-vehicle systems is presented in this paper. The algorithm combines a particular choice of navigation function with Voronoi partitions. This results not only in obstacle avoidance and motion to the goal, but also in a desirable geographical distribution of the vehicles. Our algorithm is decentralized in that each vehicle needs only to know the position of neighboring vehicles, but no other inter-vehicle communication or centralized control are required. The algorithm gives a natural priority to safety, goal convergence, and formation keeping, in that (1) collision avoidance is guaranteed under all circumstances, (2) the vehicles will move toward the goal as long as a given optimization problem is feasible, and (3) if prior criteria admit, the vehicles tend to a desirable lattice formation. These theoretical properties are discussed in the paper and the performance of the algorithm is illustrated in simulations with realistic models of twenty all-terrain vehicles. Planned experimental evaluation using customized miniature cars is also briefly described., © 2005 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. QC 20120220

The importance of a strong research agenda on the convergence of communications and control has been emphasized by several researchers recently. The purpose of this paper is to evidence through concrete application examples how the envisioned synergy can actually be exploited. The focus is on control of wireless communication networks. In order to address in a rigorous and exhaustive way the complexity of interactions that usually arise in these systems, we try to devise how hybrid modelling may intrinsically provide a theoretical framework to formulate problems and provide partial solutions., © 2005 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. QC 20120220

The importance of a strong research agenda on the convergence of communications and control has been emphasized by several researchers recently. The purpose of this paper is to evidence through concrete application examples how the envisioned synergy can actually be exploited. The focus is on control of wireless communication networks. In order to address in a rigorous and exhaustive way the complexity of interactions that usually arise in these systems, we try to devise how hybrid modelling may intrinsically provide a theoretical framework to formulate problems and provide partial solutions., © 2005 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. QC 20120220

The importance of a strong research agenda on the convergence of communications and control has been emphasized by several researchers recently. The purpose of this paper is to evidence through concrete application examples how the envisioned synergy can actually be exploited. The focus is on control of wireless communication networks. In order to address in a rigorous and exhaustive way the complexity of interactions that usually arise in these systems, we try to devise how hybrid modelling may intrinsically provide a theoretical framework to formulate problems and provide partial solutions., © 2005 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. QC 20120220

The importance of a strong research agenda on the convergence of communications and control has been emphasized by several researchers recently. The purpose of this paper is to evidence through concrete application examples how the envisioned synergy can actually be exploited. The focus is on control of wireless communication networks. In order to address in a rigorous and exhaustive way the complexity of interactions that usually arise in these systems, we try to devise how hybrid modelling may intrinsically provide a theoretical framework to formulate problems and provide partial solutions., © 2005 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. QC 20120220

The importance of a strong research agenda on the convergence of communications and control has been emphasized by several researchers recently. The purpose of this paper is to evidence through concrete application examples how the envisioned synergy can actually be exploited. The focus is on control of wireless communication networks. In order to address in a rigorous and exhaustive way the complexity of interactions that usually arise in these systems, we try to devise how hybrid modelling may intrinsically provide a theoretical framework to formulate problems and provide partial solutions., © 2005 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. QC 20120220

A new control structure is proposed to improve user experience of wireless Internet. Information on radio bandwidth and queue length available in the radio network controller (RNC), close to the base station, is used in a proxy that resides between the Internet and the cellular system. The control algorithm in the proxy sets the window size according to event-triggered information on radio bandwidth changes and time-triggered information on the queue length of the RNC. A stability analysis of the hybrid control system is performed. In a number of realistic use cases evaluated in ns-2, the new control structure is compared to a nominal one that employs end-to-end TCP Reno. It is shown that the proposed solution reduces the time to serve users, increases the radio link utilization, and decreases the required buffer size in the RNC., © 2005 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. Qc 20120220

A new control structure is proposed to improve user experience of wireless Internet. Information on radio bandwidth and queue length available in the radio network controller (RNC), close to the base station, is used in a proxy that resides between the Internet and the cellular system. The control algorithm in the proxy sets the window size according to event-triggered information on radio bandwidth changes and time-triggered information on the queue length of the RNC. A stability analysis of the hybrid control system is performed. In a number of realistic use cases evaluated in ns-2, the new control structure is compared to a nominal one that employs end-to-end TCP Reno. It is shown that the proposed solution reduces the time to serve users, increases the radio link utilization, and decreases the required buffer size in the RNC., © 2005 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. Qc 20120220

A new control structure is proposed to improve user experience of wireless Internet. Information on radio bandwidth and queue length available in the radio network controller (RNC), close to the base station, is used in a proxy that resides between the Internet and the cellular system. The control algorithm in the proxy sets the window size according to event-triggered information on radio bandwidth changes and time-triggered information on the queue length of the RNC. A stability analysis of the hybrid control system is performed. In a number of realistic use cases evaluated in ns-2, the new control structure is compared to a nominal one that employs end-to-end TCP Reno. It is shown that the proposed solution reduces the time to serve users, increases the radio link utilization, and decreases the required buffer size in the RNC., © 2005 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. Qc 20120220

A new control structure is proposed to improve user experience of wireless Internet. Information on radio bandwidth and queue length available in the radio network controller (RNC), close to the base station, is used in a proxy that resides between the Internet and the cellular system. The control algorithm in the proxy sets the window size according to event-triggered information on radio bandwidth changes and time-triggered information on the queue length of the RNC. A stability analysis of the hybrid control system is performed. In a number of realistic use cases evaluated in ns-2, the new control structure is compared to a nominal one that employs end-to-end TCP Reno. It is shown that the proposed solution reduces the time to serve users, increases the radio link utilization, and decreases the required buffer size in the RNC., © 2005 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. Qc 20120220

A new control structure is proposed to improve user experience of wireless Internet. Information on radio bandwidth and queue length available in the radio network controller (RNC), close to the base station, is used in a proxy that resides between the Internet and the cellular system. The control algorithm in the proxy sets the window size according to event-triggered information on radio bandwidth changes and time-triggered information on the queue length of the RNC. A stability analysis of the hybrid control system is performed. In a number of realistic use cases evaluated in ns-2, the new control structure is compared to a nominal one that employs end-to-end TCP Reno. It is shown that the proposed solution reduces the time to serve users, increases the radio link utilization, and decreases the required buffer size in the RNC., © 2005 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. Qc 20120220

This paper presents a method for grasp evaluation. It is based on the ability of the grasp to reject disturbance forces. The procedure takes the geometry of object into account, and it is also possible to incorporate task-oriented information. The evaluation criterion is formulated as a min-max optimization problem, for which an efficient algorithm is proposed and analyzed. The result of this algorithm is independent of scale and choice of reference frame, and can easily be visualized as a surface in the force space. The method is illustrated with several examples., © 2006 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.QC 20101221. Conference: IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2002). LAUSANNE, SWITZERLAND. SEP 30-OCT 04, 2002

This paper presents a method for grasp evaluation. It is based on the ability of the grasp to reject disturbance forces. The procedure takes the geometry of object into account, and it is also possible to incorporate task-oriented information. The evaluation criterion is formulated as a min-max optimization problem, for which an efficient algorithm is proposed and analyzed. The result of this algorithm is independent of scale and choice of reference frame, and can easily be visualized as a surface in the force space. The method is illustrated with several examples., © 2006 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.QC 20101221. Conference: IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2002). LAUSANNE, SWITZERLAND. SEP 30-OCT 04, 2002

This paper presents a method for grasp evaluation. It is based on the ability of the grasp to reject disturbance forces. The procedure takes the geometry of object into account, and it is also possible to incorporate task-oriented information. The evaluation criterion is formulated as a min-max optimization problem, for which an efficient algorithm is proposed and analyzed. The result of this algorithm is independent of scale and choice of reference frame, and can easily be visualized as a surface in the force space. The method is illustrated with several examples., © 2006 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.QC 20101221. Conference: IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2002). LAUSANNE, SWITZERLAND. SEP 30-OCT 04, 2002

This paper presents a method for grasp evaluation. It is based on the ability of the grasp to reject disturbance forces. The procedure takes the geometry of object into account, and it is also possible to incorporate task-oriented information. The evaluation criterion is formulated as a min-max optimization problem, for which an efficient algorithm is proposed and analyzed. The result of this algorithm is independent of scale and choice of reference frame, and can easily be visualized as a surface in the force space. The method is illustrated with several examples., © 2006 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.QC 20101221. Conference: IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2002). LAUSANNE, SWITZERLAND. SEP 30-OCT 04, 2002

This paper presents a method for grasp evaluation. It is based on the ability of the grasp to reject disturbance forces. The procedure takes the geometry of object into account, and it is also possible to incorporate task-oriented information. The evaluation criterion is formulated as a min-max optimization problem, for which an efficient algorithm is proposed and analyzed. The result of this algorithm is independent of scale and choice of reference frame, and can easily be visualized as a surface in the force space. The method is illustrated with several examples., © 2006 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.QC 20101221. Conference: IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2002). LAUSANNE, SWITZERLAND. SEP 30-OCT 04, 2002

We derive a power control policy for a group of sensor nodes that are monitoring a real-time application sensitive to disconnections (outages) of the communication. Specifically, we suggest that the sensor nodes perform cooperative diversity while running a sleep discipline. After the description of a detailed model of the wireless links, we propose a power minimization algorithm with a constraint expressed in terms of outage probability. Suboptimal solutions are also discussed. Numerical examples are provided for various number of nodes; wireless scenarios and nodes activities. It is argued that nodes with reduced activity show better performance., © 2006 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.QC 20110112

We derive a power control policy for a group of sensor nodes that are monitoring a real-time application sensitive to disconnections (outages) of the communication. Specifically, we suggest that the sensor nodes perform cooperative diversity while running a sleep discipline. After the description of a detailed model of the wireless links, we propose a power minimization algorithm with a constraint expressed in terms of outage probability. Suboptimal solutions are also discussed. Numerical examples are provided for various number of nodes; wireless scenarios and nodes activities. It is argued that nodes with reduced activity show better performance., © 2006 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.QC 20110112

We derive a power control policy for a group of sensor nodes that are monitoring a real-time application sensitive to disconnections (outages) of the communication. Specifically, we suggest that the sensor nodes perform cooperative diversity while running a sleep discipline. After the description of a detailed model of the wireless links, we propose a power minimization algorithm with a constraint expressed in terms of outage probability. Suboptimal solutions are also discussed. Numerical examples are provided for various number of nodes; wireless scenarios and nodes activities. It is argued that nodes with reduced activity show better performance., © 2006 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.QC 20110112

We derive a power control policy for a group of sensor nodes that are monitoring a real-time application sensitive to disconnections (outages) of the communication. Specifically, we suggest that the sensor nodes perform cooperative diversity while running a sleep discipline. After the description of a detailed model of the wireless links, we propose a power minimization algorithm with a constraint expressed in terms of outage probability. Suboptimal solutions are also discussed. Numerical examples are provided for various number of nodes; wireless scenarios and nodes activities. It is argued that nodes with reduced activity show better performance., © 2006 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.QC 20110112

We derive a power control policy for a group of sensor nodes that are monitoring a real-time application sensitive to disconnections (outages) of the communication. Specifically, we suggest that the sensor nodes perform cooperative diversity while running a sleep discipline. After the description of a detailed model of the wireless links, we propose a power minimization algorithm with a constraint expressed in terms of outage probability. Suboptimal solutions are also discussed. Numerical examples are provided for various number of nodes; wireless scenarios and nodes activities. It is argued that nodes with reduced activity show better performance., © 2006 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.QC 20110112

A new distributed algorithm for cooperative estimation of a slowly time-varying signal using a wireless sensor network is presented. The estimate in each node is based on a so called consensus algorithm, which weights measurements and estimates of neighboring nodes. The algorithm is therefore scalable with the number of network nodes. It requires only limited information exchange between nodes and computations in each node. The weights are locally optimized based on a minimum variance criterion. Numerical results show that the proposed algorithm exhibits good performance compared to other distributed algorithms proposed in the literature., © 2006 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.QC 20120216

A new distributed algorithm for cooperative estimation of a slowly time-varying signal using a wireless sensor network is presented. The estimate in each node is based on a so called consensus algorithm, which weights measurements and estimates of neighboring nodes. The algorithm is therefore scalable with the number of network nodes. It requires only limited information exchange between nodes and computations in each node. The weights are locally optimized based on a minimum variance criterion. Numerical results show that the proposed algorithm exhibits good performance compared to other distributed algorithms proposed in the literature., © 2006 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.QC 20120216

A new distributed algorithm for cooperative estimation of a slowly time-varying signal using a wireless sensor network is presented. The estimate in each node is based on a so called consensus algorithm, which weights measurements and estimates of neighboring nodes. The algorithm is therefore scalable with the number of network nodes. It requires only limited information exchange between nodes and computations in each node. The weights are locally optimized based on a minimum variance criterion. Numerical results show that the proposed algorithm exhibits good performance compared to other distributed algorithms proposed in the literature., © 2006 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.QC 20120216

A new distributed algorithm for cooperative estimation of a slowly time-varying signal using a wireless sensor network is presented. The estimate in each node is based on a so called consensus algorithm, which weights measurements and estimates of neighboring nodes. The algorithm is therefore scalable with the number of network nodes. It requires only limited information exchange between nodes and computations in each node. The weights are locally optimized based on a minimum variance criterion. Numerical results show that the proposed algorithm exhibits good performance compared to other distributed algorithms proposed in the literature., © 2006 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.QC 20120216

A new distributed algorithm for cooperative estimation of a slowly time-varying signal using a wireless sensor network is presented. The estimate in each node is based on a so called consensus algorithm, which weights measurements and estimates of neighboring nodes. The algorithm is therefore scalable with the number of network nodes. It requires only limited information exchange between nodes and computations in each node. The weights are locally optimized based on a minimum variance criterion. Numerical results show that the proposed algorithm exhibits good performance compared to other distributed algorithms proposed in the literature., © 2006 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.QC 20120216

Bandwidth limitations and energy constraints set severe restrictions on the design of control systems that utilize wireless sensor and actuator networks. It is common in these systems that a sensor node needs not be continuously monitored, but communicates to the controller only at certain instances when it detects a disturbance event. In this paper, such a scenario is studied and particular emphasis is on efficient utilization of the shared communication resources. Encoder-decoder design for an event-based control system with the plant affected by pulse disturbances is considered. A new iterative procedure is proposed which can jointly optimize encoder-decoder pairs for a certainty equivalent controller. The goal is to minimize a design criterion, in particular, a linear quadratic cost over a finite horizon. The algorithm leads to a feasible design of time-varying non-uniform encoder-decoder pairs. Numerical results demonstrate significant improvements in performance compared to a system using uniform quantization., © 2006 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.QC 20101221

Bandwidth limitations and energy constraints set severe restrictions on the design of control systems that utilize wireless sensor and actuator networks. It is common in these systems that a sensor node needs not be continuously monitored, but communicates to the controller only at certain instances when it detects a disturbance event. In this paper, such a scenario is studied and particular emphasis is on efficient utilization of the shared communication resources. Encoder-decoder design for an event-based control system with the plant affected by pulse disturbances is considered. A new iterative procedure is proposed which can jointly optimize encoder-decoder pairs for a certainty equivalent controller. The goal is to minimize a design criterion, in particular, a linear quadratic cost over a finite horizon. The algorithm leads to a feasible design of time-varying non-uniform encoder-decoder pairs. Numerical results demonstrate significant improvements in performance compared to a system using uniform quantization., © 2006 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.QC 20101221

Bandwidth limitations and energy constraints set severe restrictions on the design of control systems that utilize wireless sensor and actuator networks. It is common in these systems that a sensor node needs not be continuously monitored, but communicates to the controller only at certain instances when it detects a disturbance event. In this paper, such a scenario is studied and particular emphasis is on efficient utilization of the shared communication resources. Encoder-decoder design for an event-based control system with the plant affected by pulse disturbances is considered. A new iterative procedure is proposed which can jointly optimize encoder-decoder pairs for a certainty equivalent controller. The goal is to minimize a design criterion, in particular, a linear quadratic cost over a finite horizon. The algorithm leads to a feasible design of time-varying non-uniform encoder-decoder pairs. Numerical results demonstrate significant improvements in performance compared to a system using uniform quantization., © 2006 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.QC 20101221

Bandwidth limitations and energy constraints set severe restrictions on the design of control systems that utilize wireless sensor and actuator networks. It is common in these systems that a sensor node needs not be continuously monitored, but communicates to the controller only at certain instances when it detects a disturbance event. In this paper, such a scenario is studied and particular emphasis is on efficient utilization of the shared communication resources. Encoder-decoder design for an event-based control system with the plant affected by pulse disturbances is considered. A new iterative procedure is proposed which can jointly optimize encoder-decoder pairs for a certainty equivalent controller. The goal is to minimize a design criterion, in particular, a linear quadratic cost over a finite horizon. The algorithm leads to a feasible design of time-varying non-uniform encoder-decoder pairs. Numerical results demonstrate significant improvements in performance compared to a system using uniform quantization., © 2006 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.QC 20101221

Bandwidth limitations and energy constraints set severe restrictions on the design of control systems that utilize wireless sensor and actuator networks. It is common in these systems that a sensor node needs not be continuously monitored, but communicates to the controller only at certain instances when it detects a disturbance event. In this paper, such a scenario is studied and particular emphasis is on efficient utilization of the shared communication resources. Encoder-decoder design for an event-based control system with the plant affected by pulse disturbances is considered. A new iterative procedure is proposed which can jointly optimize encoder-decoder pairs for a certainty equivalent controller. The goal is to minimize a design criterion, in particular, a linear quadratic cost over a finite horizon. The algorithm leads to a feasible design of time-varying non-uniform encoder-decoder pairs. Numerical results demonstrate significant improvements in performance compared to a system using uniform quantization., © 2006 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.QC 20101221

Encoder-decoder design is considered for a closed-loop scalar control system with feedback transmitted over a binary symmetric channel. We propose an iterative procedure which can jointly optimize adaptive encoder-decoder pairs for a certainly equivalence controller. The goal is to minimize a design criterion, in particular, the linear quadratic (LQ) cost function over a finite horizon. The algorithm leads to a practically feasible design of time-varying non-uniform encoding and decoding. Numerical results demonstrate the promising performance obtained by employing the proposed iterative optimization algorithm., © 2006 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.QC 20120216

Encoder-decoder design is considered for a closed-loop scalar control system with feedback transmitted over a binary symmetric channel. We propose an iterative procedure which can jointly optimize adaptive encoder-decoder pairs for a certainly equivalence controller. The goal is to minimize a design criterion, in particular, the linear quadratic (LQ) cost function over a finite horizon. The algorithm leads to a practically feasible design of time-varying non-uniform encoding and decoding. Numerical results demonstrate the promising performance obtained by employing the proposed iterative optimization algorithm., © 2006 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.QC 20120216

Encoder-decoder design is considered for a closed-loop scalar control system with feedback transmitted over a binary symmetric channel. We propose an iterative procedure which can jointly optimize adaptive encoder-decoder pairs for a certainly equivalence controller. The goal is to minimize a design criterion, in particular, the linear quadratic (LQ) cost function over a finite horizon. The algorithm leads to a practically feasible design of time-varying non-uniform encoding and decoding. Numerical results demonstrate the promising performance obtained by employing the proposed iterative optimization algorithm., © 2006 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.QC 20120216

Encoder-decoder design is considered for a closed-loop scalar control system with feedback transmitted over a binary symmetric channel. We propose an iterative procedure which can jointly optimize adaptive encoder-decoder pairs for a certainly equivalence controller. The goal is to minimize a design criterion, in particular, the linear quadratic (LQ) cost function over a finite horizon. The algorithm leads to a practically feasible design of time-varying non-uniform encoding and decoding. Numerical results demonstrate the promising performance obtained by employing the proposed iterative optimization algorithm., © 2006 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.QC 20120216

Encoder-decoder design is considered for a closed-loop scalar control system with feedback transmitted over a binary symmetric channel. We propose an iterative procedure which can jointly optimize adaptive encoder-decoder pairs for a certainly equivalence controller. The goal is to minimize a design criterion, in particular, the linear quadratic (LQ) cost function over a finite horizon. The algorithm leads to a practically feasible design of time-varying non-uniform encoding and decoding. Numerical results demonstrate the promising performance obtained by employing the proposed iterative optimization algorithm., © 2006 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.QC 20120216

Wireless networked embedded systems are becoming increasingly important in a wide area of technical fields. In this tutorial paper we present recent results on the design of these systems and their use in control applications, that have been developed within the project Reconfigurable Ubiquitous Networked Embedded Systems (RUNES). RUNES is a European Integrated Project with the aim to control complexity in networked embedded systems by developing robust and scalable middleware systems. New components for control under varying network conditions are discussed for the RUNES architecture. The paper highlights how the complexity of the closed-loop system is increased, due to additional disturbances introduced by the communication system: additional delays, jitter, data rate limitations, packet losses, etc. Experimental work on integration test beds that demonstrates these results is presented, together with motivating links to the RUNES disaster relief tunnel scenario., © 2006 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. QC 20120216

Wireless networked embedded systems are becoming increasingly important in a wide area of technical fields. In this tutorial paper we present recent results on the design of these systems and their use in control applications, that have been developed within the project Reconfigurable Ubiquitous Networked Embedded Systems (RUNES). RUNES is a European Integrated Project with the aim to control complexity in networked embedded systems by developing robust and scalable middleware systems. New components for control under varying network conditions are discussed for the RUNES architecture. The paper highlights how the complexity of the closed-loop system is increased, due to additional disturbances introduced by the communication system: additional delays, jitter, data rate limitations, packet losses, etc. Experimental work on integration test beds that demonstrates these results is presented, together with motivating links to the RUNES disaster relief tunnel scenario., © 2006 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. QC 20120216

Wireless networked embedded systems are becoming increasingly important in a wide area of technical fields. In this tutorial paper we present recent results on the design of these systems and their use in control applications, that have been developed within the project Reconfigurable Ubiquitous Networked Embedded Systems (RUNES). RUNES is a European Integrated Project with the aim to control complexity in networked embedded systems by developing robust and scalable middleware systems. New components for control under varying network conditions are discussed for the RUNES architecture. The paper highlights how the complexity of the closed-loop system is increased, due to additional disturbances introduced by the communication system: additional delays, jitter, data rate limitations, packet losses, etc. Experimental work on integration test beds that demonstrates these results is presented, together with motivating links to the RUNES disaster relief tunnel scenario., © 2006 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. QC 20120216

Wireless networked embedded systems are becoming increasingly important in a wide area of technical fields. In this tutorial paper we present recent results on the design of these systems and their use in control applications, that have been developed within the project Reconfigurable Ubiquitous Networked Embedded Systems (RUNES). RUNES is a European Integrated Project with the aim to control complexity in networked embedded systems by developing robust and scalable middleware systems. New components for control under varying network conditions are discussed for the RUNES architecture. The paper highlights how the complexity of the closed-loop system is increased, due to additional disturbances introduced by the communication system: additional delays, jitter, data rate limitations, packet losses, etc. Experimental work on integration test beds that demonstrates these results is presented, together with motivating links to the RUNES disaster relief tunnel scenario., © 2006 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. QC 20120216