S. Schaffert
University of California, Berkeley
6 Papers
158 Citations
S. Schaffert is an academic researcher from University of California, Berkeley. The author has contributed to research in topics: Wireless sensor network & Key distribution in wireless sensor networks. The author has an hindex of 6, co-authored 6 publications.
Chat about Author
Papers
Distributed control applications within sensor networks
Bruno Sinopoli,Cory Sharp,Luca Schenato,S. Schaffert,S. Shankar Sastry +4 more
- 11 Aug 2003
TL;DR: This paper presents a hierarchical model composed of continuous time-trigger components at the low level and discrete event-triggered component at the high level and suggests a mixed model for design, analysis, and synthesis of control algorithms within sensor networks.
Design and implementation of a sensor network system for vehicle tracking and autonomous interception
Cory Sharp,S. Schaffert,Alec Woo,Naveen Sastry,Chris Karlof,S. Shankar Sastry,David E. Culler +6 more
- 31 Jan 2005
TL;DR: The design and implementation of PEG is described, a networked system of distributed sensor nodes that detects an uncooperative agent called the evader and assists an autonomous robot called the pursuer in capturing the evaders.
Instrumenting wireless sensor networks for real-time surveillance
Phoebus Chen,Songhwai Oh,Michael Manzo,Bruno Sinopoli,Cory Sharp,Kamin Whitehouse,O. Tolle,Jaein Jeong,Prabal Dutta,Jonathan W. Hui,S. Schaffert,Sukun Kim,Jay Taneja,Bo Zhu,Tanya Roosta,Matthew Howard,David E. Culler,S. Shankar Sastry +17 more
- 15 May 2006
TL;DR: To the authors' best knowledge, this experiment is the largest demonstration to date of a real-time tracking and control system on a wireless sensor network that does not use classification information.
103
Decidable and semi-decidable controller synthesis for classes of discrete time hybrid systems
René Vidal,S. Schaffert,O. Shakernia,John Lygeros,S. Shankar Sastry +4 more
- 04 Dec 2001
TL;DR: This paper shows how the classical algorithm for computing the maximal controlled invariant set and the least restrictive controller is computable and guaranteed to terminate in a finite number of iterations and how the algorithm can be encoded using quantifier elimination, which leads to a semi-decidability result for definable hybrid systems.
42
Controlled Invariance of Discrete Time Systems
René Vidal,S. Schaffert,John Lygeros,S. Shankar Sastry +3 more
- 23 Mar 2000
TL;DR: An algorithm for computing the maximal controlled invariant set and the least restrictive controller for discrete time systems and it is shown how the algorithm can be encoded using quantifier elimination, which leads to a semi-decidability result for definable systems.