Publications related to Adaptive Highways on a Grid

Related publications (19)

Certification of Bottleneck Task Assignment With Shortest Path Criteria

Minimising the longest travel distance for a group of mobile robots with interchangeable goals requires knowledge of the shortest length paths between all robots and goal destinations. Determining the exact length of the shortest paths in an environment wi ...

2023

Haptics based collaborative steering control in automated driving environments

Tomohiro Nakade

A vehicle's steering is a particular system in that it is exposed to individual subjective reviews based on criteria that are hard to assess quantitatively. Haptic design of such systems is a prime concern that has been at the center of industrial developm ...

EPFL2023

Hybrid Flock - Formation Control Algorithms

Alcherio Martinoli, Cyrill Silvan Baumann

Two prominent categories for achieving coordinated multirobot displacement are flocking and navigation in formation. Both categories have their own body of literature and characteristics, including their respective advantages and disadvantages. While typic ...

Springer Nature Switzerland2022

An automatized method to determine latencies of motor-evoked potentials under physiological and pathophysiological conditions

Friedhelm Christoph Hummel, Takuya Morishita, Pierre Theopistos Vassiliadis, Andéol Geoffroy Cadic-Melchior, Claudia Bigoni

Background. Latencies of motor evoked potentials (MEPs) can provide insights into the motor neuronal pathways activated by transcranial magnetic stimulation. Notwithstanding its clinical relevance, accurate, unbiased methods to automatize latency detection ...

IOP Publishing Ltd2022

Faster Monotone Min-Plus Product, Range Mode, and Single Source Replacement Paths

Adam Teodor Polak

One of the most basic graph problems, All-Pairs Shortest Paths (APSP) is known to be solvable in n^{3-o(1)} time, and it is widely open whether it has an O(n^{3-ε}) time algorithm for ε > 0. To better understand APSP, one often strives to obtain subcubic t ...

Schloss Dagstuhl -- Leibniz-Zentrum für Informatik2021

Symbolic Algorithms for Token Swapping

Giovanni De Micheli, Mathias Soeken, Bruno Schmitt Antunes

We study different symbolic algorithms to solve two related reconfiguration problems on graphs: the token swapping problem and the permutation routing via matchings problem. Input to both problems is a connected graph with labeled vertices and a token in e ...

2020

Biomimetic adaptive control of a deployable tensegrity structure

Ann Christine Sychterz

Biomimetic behavior includes aspects such as learning from previous experience, self-diagnosis, and adaptation. This thesis describes control methodologies that are essential to development towards biomimetic behavior of a complex deployable structure. Sim ...

EPFL2018

Priority coordination of fiber positioners in multi-objects spectrographs

Denis Gillet, Jean-Paul Richard Kneib, Mohamed Bouri, Laleh Makarem

Projects such as "The Dark Energy Spectroscopic Instrument" (DESI) [1] or "The Multi Object Optical and Near-infrared Spectrograph" (MOONS) [5] are developing spectrographs, composed of more than thousand of optical fibers in a confined hexagonal focal pla ...

SPIE-INT SOC OPTICAL ENGINEERING2018

Real-Time Optimization via Directional Modifier Adaptation, with Application to Kite Control

Sean Costello

The steady advance of computational methods makes model-based optimization an increasingly attractive method for process improvement. Unfortunately, the available models are often inaccurate. The traditional remedy is to update the model parameters, but th ...

EPFL2015

Joint Power Allocation and Path Selection for Multi-Hop Noncoherent Decode and Forward UWB Communications

Marco Mondelli, Xiaoli Ma

With the aim of extending the coverage and improving the performance of impulse radio ultra-wideband (UWB) systems, this paper focuses on developing a novel single differential encoded decode and forward (DF) non-cooperative relaying scheme (NCR). To favor ...

Ieee-Inst Electrical Electronics Engineers Inc2014

Algorithm to calculate a large number of roots of the cross-product of Bessel functions

Juan Ramon Mosig, Michael Mattes, Francisco Edén Sorolla Rosario

This paper describes an algorithm to calculate a large number of roots of the cross-product of Bessel functions and of their first derivatives. The algorithm initially finds the roots of the zeroth order using an auxiliary function that exhibits the same r ...

Institute of Electrical and Electronics Engineers2013

Distributed spatiotemporal suppression for environmental data collection in real-world sensor networks

Alcherio Martinoli, Alexander Bahr, William Christopher Evans

Environmental processes are often severely over-sampled. As sensor networks become more ubiquitous for this purpose, increasing network longevity becomes ever more important. Radio transceivers in particular are a great source of energy consumption, and ma ...

Ieee Computer Soc2013

Semi-Supervised Novelty Detection using SVM entire solution path

Jean-Philippe Thiran, Devis Tuia, Frank Grégoire Jean de Morsier, Volker Gass, Maurice Borgeaud

Very often, the only reliable information available to perform change detection is the description of some unchanged regions. Since sometimes these regions do not contain all the relevant information to identify their counterpart (the changes), we consider ...

Institute of Electrical and Electronics Engineers2013

Real-Time High-Precision Reading Algorithm for the Ironless Inductive Position Sensor

Alessandro Danisi

This paper presents a novel reading algorithm for an ironless inductive position sensor which exhibits immunity to single-frequency interference (both for high and low frequency signals). This algorithm is based on the three-parameter sine fitting, whose p ...

Ieee-Inst Electrical Electronics Engineers Inc2013

Formation preserving path finding in 3-D terrains

Ali Galip Bayrak

Navigation of a group of autonomous agents that are required to maintain a formation is a challenging task which has not been studied much especially in 3-D terrains. This paper presents a novel approach to collision free path finding of multiple agents pr ...

Springer Verlag2012

Multi-experts scheduling system for real-time applications

This thesis focuses on the decisional process of autonomous systems, and more particularly, on the way to take a decision when the time at disposal in order to assess the whole situation is shorter than necessary. Indeed, numerous systems propose solutions ...

EPFL2009

Gene Expression Data Analysis Using a Novel Approach to Biclustering Combining Discrete and Continuous Data

Lei Zhang, Yann Christinat

Many different methods exist for pattern detection in gene expression data. In contrast to classical methods, biclustering has the ability to cluster a group of genes together with a group of conditions (replicates, set of patients, or drug compounds). How ...

2008

New dynamic programming algorithms for the resource constrained shortest path problem

Matteo Salani

The resource constrained elementary shortest path problem (RCESPP) arises as a pricing subproblem in branch-and-price algorithms for vehicle-routing problems with additional constraints. We address the optimization of the RCESPP and we present and compare ...

2008

Distributed Adaptation in Multi-Robot Search using Particle Swarm Optimization

Alcherio Martinoli

We present an adaptive strategy for a group of robots engaged in the localization of multiple targets. The robotic search algorithm is inspired by chemotaxis behavior in bacteria, and the algorithmic parameters are updated using a distributed implementatio ...

2008