Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Distributed Intelligent Systems: Acoustic Field Estimation

In course

ENG-466: Distributed intelligent systems

The goal of this course is to provide methods and tools for modeling distributed intelligent systems as well as designing and optimizing coordination strategies. The course is a well-balanced mixture of theory and practical activities. ...

Description

This lecture covers the estimation of an acoustic field using wireless sensor networks. Topics include hierarchical topology, quadtree structure, distributed control using state machines, threshold-based pruning, experimental setups with e-puck robots, spatiotemporal data suppression, in-network power monitoring, and energy-efficient reporting strategies. The instructor discusses the challenges of implementing AI techniques in real systems and the trade-offs between robustness and efficiency.

This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.

Watch on Mediaspace

Instructor

Alcherio Martinoli

I received my Diploma in Electrical Engineering from the Swiss Federal Institute of Technology in Zurich (ETHZ), and a Ph.D. in Computer Science from the Swiss Federal Institute of Technology in Lausanne (EPFL). I am currently an Associate Professor at the School of Architecture, Civil, and Environmental Engineering and the head of the Distributed Intelligent Systems and Algorithms Laboratory. Before joining EPFL I carried out research activities at the Institute of Biomedical Engineering of the ETHZ, at the Institute of Industrial Automation of the Spanish Research Council in Madrid, Spain, and at the California Institute of Technology, Pasadena, U.S.A. Additional information can be found on my full CV.

Official source

Related concepts (32)

Wireless sensor network

Wireless sensor networks (WSNs) refer to networks of spatially dispersed and dedicated sensors that monitor and record the physical conditions of the environment and forward the collected data to a central location. WSNs can measure environmental conditions such as temperature, sound, pollution levels, humidity and wind. These are similar to wireless ad hoc networks in the sense that they rely on wireless connectivity and spontaneous formation of networks so that sensor data can be transported wirelessly.

Finite-state machine

A finite-state machine (FSM) or finite-state automaton (FSA, plural: automata), finite automaton, or simply a state machine, is a mathematical model of computation. It is an abstract machine that can be in exactly one of a finite number of states at any given time. The FSM can change from one state to another in response to some inputs; the change from one state to another is called a transition. An FSM is defined by a list of its states, its initial state, and the inputs that trigger each transition.

Efficient energy use

Efficient energy use, sometimes simply called energy efficiency, is the process of reducing the amount of energy required to provide products and services. For example, insulating a building allows it to use less heating and cooling energy to achieve and maintain a thermal comfort. Installing light-emitting diode bulbs, fluorescent lighting, or natural skylight windows reduces the amount of energy required to attain the same level of illumination compared to using traditional incandescent light bulbs.

Moore machine

In the theory of computation, a Moore machine is a finite-state machine whose current output values are determined only by its current state. This is in contrast to a Mealy machine, whose output values are determined both by its current state and by the values of its inputs. Like other finite state machines, in Moore machines, the input typically influences the next state. Thus the input may indirectly influence subsequent outputs, but not the current or immediate output. The Moore machine is named after Edward F.

Mealy machine

In the theory of computation, a Mealy machine is a finite-state machine whose output values are determined both by its current state and the current inputs. This is in contrast to a Moore machine, whose output values are determined solely by its current state. A Mealy machine is a deterministic finite-state transducer: for each state and input, at most one transition is possible. The Mealy machine is named after George H. Mealy, who presented the concept in a 1955 paper, "A Method for Synthesizing Sequential Circuits".

Related lectures (29)

Theoretical Properties of RNNs

Explores the theoretical properties and practical power of Recurrent Neural Networks, including their relationship to state machines and Turing completeness.

State Machine Principle MOOC: The Thymio robot as a tool for discovering digital science

Explores practical challenges to understand the state machine concept and the importance of clear instructions for robots.

Sequential Systems: Microcontrollers

Explores sequential systems, state machines, microcontroller solutions, logical systems, and practical applications in real-world projects.

Introducing Advanced Computing Concepts with VPL MOOC: The Thymio robot as a tool for discovering digital science

Explores advanced concepts in programming with Thymio and VPL interface.

Exergy Analysis in Energy Systems