Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Magnus Lindhé

dblp:86/3461 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 2010
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 3 first-authorSystems, architecture and hardware · 3 · 3 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
3 papers
Motion planning and robot control · 63% Multi-agent systems · 37%
Computer networks
2 papers
Wireless networking · 70% Physical-layer communications · 30%

Topics — the 7 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Robotics › Motion planning and robot control
robot control
0.222010
Adaptive exploitation of multipath fading for mobile sensors · ICRA 2010
Communication-aware trajectory tracking · ICRA 2008
Robotics › Motion planning and robot control › robot control
trajectory tracking
0.112008
Communication-aware trajectory tracking · ICRA 2008
Physical-layer communications › fading channels
multipath fading
0.112008
Communication-aware trajectory tracking · ICRA 2008
Wireless networking › wireless link
wireless link quality
0.112008
Communication-aware trajectory tracking · ICRA 2008
Knowledge, reasoning and agents › Multi-agent systems › collective behavior › swarm behavior › collective motion
flocking
0.112005
Flocking with Obstacle Avoidance: A New Distributed Coordination Algorithm Based on Voronoi Partitions · ICRA 2005
Knowledge, reasoning and agents › Multi-agent systems
formation control
0.112005
Flocking with Obstacle Avoidance: A New Distributed Coordination Algorithm Based on Voronoi Partitions · ICRA 2005
Knowledge, reasoning and agents › Multi-agent systems
multi-robot coordination
0.112005
Flocking with Obstacle Avoidance: A New Distributed Coordination Algorithm Based on Voronoi Partitions · ICRA 2005

Methods — techniques the papers use, named apart from their topics

feedback control · 0.2fading parameter estimation · 0.2closed-loop estimation · 0.2relaxed dynamic programming · 0.2hybrid optimal control · 0.2voronoi partition · 0.1navigation functions · 0.1distributed control · 0.1
YearPublicationVenuePosition
2010 Adaptive exploitation of multipath fading for mobile sensors
abstract
Mobile wireless sensors in indoor environments will experience multipath fading, causing rapid variations in the capacity of the radio link. We present a strategy that increases the throughput by modifying the trajectory of the sensor so it spends more time at positions where the capacity is high. While doing so, it still maintains some desired average velocity. Our approach includes closed-loop estimation of the parameters of the fading, which may change when moving between rooms. We prove stability of the feedback system and illustrate its behavior through simulations. Finally, we demonstrate robustness to errors in the channel model.
Magnus Lindhé, Karl Henrik Johansson
ICRA1
2008 Communication-aware trajectory tracking
abstract
This paper investigates the scenario of a robot making a tradeoff between tracking a time-varying reference trajectory and stopping to communicate at points where the radio signal strength is high. Under the assumption that the signal is subject to multipath fading, we formulate this as a hybrid optimal control problem with penalties on tracking error, communication buffer length and control power. The problem is then solved using relaxed dynamic programming, resulting in control laws for the discrete switching sequence and the continuous control. We finally illustrate the results through simulations under non-ideal conditions, confirming that the system maintains a bounded buffer size and zero-mean tracking error.
Magnus Lindhé, Karl Henrik Johansson
ICRA1
2005 Flocking with Obstacle Avoidance: A New Distributed Coordination Algorithm Based on Voronoi Partitions
abstract
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 neigh boring 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.
Magnus Lindhé, Petter Ögren, Karl Henrik Johansson
ICRA1