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

Lillian Lin

dblp:202/2440 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2019
0000-0002-2834-9234ORCID · reported

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

Applied, interdisciplinary, general and emerging computing · 2Theory of computation · 1

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.

Theoretical computer science
1 paper
Computational geometry · 33% Approximation and online algorithms · 33% Mathematical optimization · 17%
Artificial intelligence
1 paper
Robot manipulation · 61% Motion planning and robot control · 30% Multi-agent systems · 9%

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

TopicWeightPapersLastEvidence papers
Robotics › Robot manipulation
micro/nano robotics
0.312018
Steering a Swarm of Particles Using Global Inputs and Swarm Statistics · IEEE Trans. Robotics 2018
Robotics › Motion planning and robot control
robot control
0.312018
Steering a Swarm of Particles Using Global Inputs and Swarm Statistics · IEEE Trans. Robotics 2018
Robotics › Robot manipulation › cooperative manipulation
swarm manipulation
0.312018
Steering a Swarm of Particles Using Global Inputs and Swarm Statistics · IEEE Trans. Robotics 2018
Approximation and online algorithms
approximation algorithms
0.312018
Coordinated Motion Planning: The Video (Multimedia Exposition) · SoCG 2018
Approximation and online algorithms › approximation algorithms
constant-factor approximation
0.312018
Coordinated Motion Planning: The Video (Multimedia Exposition) · SoCG 2018
Computational geometry › motion planning
coordinated motion planning
0.312018
Coordinated Motion Planning: The Video (Multimedia Exposition) · SoCG 2018
Mathematical optimization › scheduling › completion time minimization
makespan minimization
0.312018
Coordinated Motion Planning: The Video (Multimedia Exposition) · SoCG 2018
Computational geometry
motion planning
0.312018
Coordinated Motion Planning: The Video (Multimedia Exposition) · SoCG 2018
Graph algorithms and graph theory › graph spanners
stretch factor
0.312018
Coordinated Motion Planning: The Video (Multimedia Exposition) · SoCG 2018
Knowledge, reasoning and agents › Multi-agent systems
swarm robotics
0.112018
Steering a Swarm of Particles Using Global Inputs and Swarm Statistics · IEEE Trans. Robotics 2018

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

online games · 0.3mean and variance control · 0.3hysteresis-based switching control · 0.3geometric trajectory computation · 0.3
YearPublicationVenuePosition
2019 Planar Orientation Control and Torque Maximization Using a Swarm With Global Inputs
abstract
This paper studies the torque applied by a large number of particles on a long aspect-ratio rod. The particles are all pushed in the same direction by a global signal. We calculate the force and torque generated by three canonical position distributions of a swarm: uniform, triangular, and normal. The model shows that for a pivoted rod the uniform distribution produces the maximum torque for small swarm standard deviations, but the normal distribution maximizes torque for large standard deviations. In the simulation, we use these results to design proportional-derivative controllers to orient rigid objects. We conclude showing the experiments with up to 97 hardware robots to evaluate our theory in practice.
Shiva Shahrokhi, Lillian Lin, Aaron T. Becker
IEEE Trans Autom. Sci. Eng.2
2018 Coordinated Motion Planning: The Video (Multimedia Exposition)
abstract
We motivate, visualize and demonstrate recent work for minimizing the total execution time of a coordinated, parallel motion plan for a swarm of N robots in the absence of obstacles. Under relatively mild assumptions on the separability of robots, the algorithm achieves constant stretch: If all robots want to move at most d units from their respective starting positions, then the total duration of the overall schedule (and hence the distance traveled by each robot) is O(d) steps; this implies constant-factor approximation for the optimization problem. Also mentioned is an NP-hardness result for finding an optimal schedule, even in the case in which robot positions are restricted to a regular grid. On the other hand, we show that for densely packed disks that cannot be well separated, a stretch factor Omega(N^{1/4}) is required in the worst case; we establish an achievable stretch factor of O(N^{1/2}) even in this case. We also sketch geometric difficulties of computing optimal trajectories, even for just two unit disks.
Aaron T. Becker, Sándor P. Fekete, Phillip Keldenich, Matthias Konitzny, Lillian Lin, Christian Scheffer
SoCG5
2018 Steering a Swarm of Particles Using Global Inputs and Swarm Statistics
abstract
Microrobotics has the potential to revolutionize many applications including targeted material delivery, assembly, and surgery. The same properties that promise breakthrough solutions-small size and large populations-present unique challenges for controlling motion. Robotic manipulation usually assumes intelligent agents, not particle systems manipulated by a global signal. To identify the key parameters for particle manipulation, we used a collection of online games in which players steer swarms of up to 500 particles to complete manipulation challenges. We recorded statistics from more than 10 000 players. Inspired by techniques in which human operators performed well, we investigate controllers that use only the mean and variance of the swarm. We prove that mean position is controllable and provide conditions under which variance is controllable. We next derive automatic controllers for these and a hysteresis-based switching control to regulate the first two moments of the particle distribution. Finally, we employ these controllers as primitives for an object manipulation task and implement all controllers on 100 kilobots controlled by the direction of a global light source.
Shiva Shahrokhi, Lillian Lin, Chris Ertel, Mable Wan, Aaron T. Becker
IEEE Trans. Robotics2