Draft
PhD defence · University of Southern Denmark

Cooperative controlof multi-robot systemsin the real world

What it takes to go from a search and rescue procedure on paper to a swarm of drones that plans, talks and searches without a server, a network, or a pilot per aircraft.

Kasper Andreas Rømer GrøntvedSDU UAS CenterDefended 2025
One sentence of framing before the first slide: this thesis is five components of one toolchain, each pushed by a real Danish rescue operation and each tested outside the lab. Ported from the Google Slides defence deck. Images that lived only in that deck are marked as draft placeholders; drop them in and remove the Draft badge.
Context · HERD

The HERD project set the frame

Human-AI collaboration: engaging and controlling swarms of robots and drones, so that one operator can direct many autonomous systems at once.

Cooperative behaviour

Several drones have to fulfil one shared mission objective, not several private ones.

From human intent to autonomous behaviour

A mission objective spoken by an operator has to become something a system can execute.

Tasks that match real procedures

Formalise and automate tasks that align with how operations are actually run, not how a benchmark says they are.

TRL 4

Prototypes and lab experiments

The project's technology readiness level bounds the scope. Everything here is a validated component, not a certified product.

The thread through the thesis

Every component exists because a rescue operation needed it, and each was taken outdoors at least once.

  • The HERD Project: Human Multi-Robot Interaction in Search & Rescue and in Farming · Christensen et al., Human-Multi-Robot Systems Workshop, Kyoto 2022
Cooperative multi-robot control
Keep this to the three challenges. The TRL card manages expectations early: nobody will ask "why is it not deployed" if you have said prototype out loud on slide two.
Agenda

Five pieces of one toolchain

The order follows the operation: define it, divide it, command it, connect it, then measure it.

1 · Defining SAR operations in Denmark

How the emergency agency searches today, and what a drone system must respect.

2 · Decentralized task allocation

Trajectory tasks and a consensus-based bundle algorithm that needs no coordinator.

3 · Swarm control through programming interfaces

Two declarative languages between the operator and the mission.

4 · Communication without infrastructure

SwarmTalk: broadcast messaging on €10 hardware, tested in the air.

5 · A dataset and benchmark for informed search

SAREnv: lost-person probability maps and three metrics.

6 · Other contributions

User studies, wildlife monitoring and where the work goes next.

Cooperative multi-robot control
Ten seconds. The one thing to plant: these are not five projects, they are the five things an autonomous search needs at the same time.
Part one

Defining SAR operations in Denmark

Before a drone can help with a search, someone has to write down what a search is.

Danish SAR · today

The quality of the search depends on the operator

A drone-assisted search today is manual coverage and point-of-interest inspection, run by two or three people under a chain of command.

  • One operator pilots. Coverage is flown by hand, one aircraft at a time.
  • One or two inspect video. Detection is a person watching a feed.
  • A chain of command decides. New information and priorities flow through people.
  • The bottleneck is human attention. How much new information an operator can absorb sets the ceiling on the search.

The finding that motivates the thesis

The quality of a search is highly dependent on the operator. Any system that helps has to reduce that dependence rather than add another screen.

Where this comes from

A field study of Danish drone-supported rescue operations with the emergency management agency, DEMA.

Hoang et al., 2023
Cooperative multi-robot control
Describe an actual operation for thirty seconds: the van, the pilot, the two people squinting at a tablet. Then read the dark card. Everything after this slide is an attempt to move work off that pilot.
Danish SAR · the environment

A search is a moving target

Four things change while the drones are in the air, and the plan has to change with them.

Search area

Grows, shrinks and moves as witnesses report and terrain is cleared.

Direction of search

Where the person was last seen and where they are likely to go decide the sweep.

Number of drones

Aircraft land to swap batteries and rejoin; the team size is never constant.

Search priority

The incident commander re-weights areas as the operation unfolds.

Completeness and redundancy are the requirement

A missed patch is a failed search. A system that is fast but leaves gaps is worse than a slow one that does not, so every method in this thesis is judged first on whether it covers everything.

Cooperative multi-robot control
The point is not the four variables, it is that the plan must be recomputed while flying. That rules out anything that needs the whole problem known in advance, and sets up Part two.
Danish SAR · the procedure

The OFS method makes searches consistent

The Danish Emergency Management Agency searches in a fixed order: Overview, Focused, Systematic. We evaluated it in the field.

Overview

Get the whole area in view. Where are the roads, the water, the edges?

Focused

Inspect the points of interest the overview surfaced.

Systematic

Sweep what remains with coverage lines, so nothing is left to chance.

Where it still falls short

OFS ensures consistency over best practice. It does not make the task generation consistent: two operators given the same map still draw different lines and pick different points.

18

field experiments

Across four different geographical areas, with 180 simulated missing persons between them.

Cooperative multi-robot control
Say the three words slowly; they return on the next slide as task types. The caveat card is the hinge: the procedure is consistent, the tasks it produces are not, and that is exactly what software is good at.
Danish SAR · task generation

From OFS to tasks a drone can take

If the procedure is fixed, the tasks can be generated automatically from the environment.

Environment

The search polygon, terrain, roads, water, buildings, and the environmental features that shape where people end up.

get familiar with the ground

The OFS rules

Overview becomes a perimeter pass, Focused becomes interest points, Systematic becomes coverage lines over what is left.

the procedure, encoded

Tasks

Coverage lines and interest points, generated the same way every time, ready for an allocator to divide between drones.

consistent by construction

Why this matters for everything after it

The rest of the thesis assumes tasks exist. This is where they come from, and it is why the allocator in Part two has to handle lines, not just points.

Cooperative multi-robot control
Walk the three cards left to right. The last sentence of the bottom card is the bridge to the next section, so land on it.
Part two

How can drones plan a search together?

The field study set the requirements: cheap, lightweight, low overhead, an ad hoc infrastructure, and complete. We do not want to miss anything.

Two requirements do the work: no infrastructure, and completeness. Hold them up against every method that follows.
Task allocation · state of the art

Coverage planning assumes you know everything in advance

The strongest multi-robot coverage methods are near-optimal, centralized, and solved before take-off.

  • Everything known pre-operation. Area, robots, capacities and costs are inputs to one solve.
  • No on-the-fly planning. A change in the field means a new problem and a new solution from scratch.
  • Near-optimal. Which is exactly why the community likes them, and why they are the benchmark to beat.
  • One computer in the loop. A centralized system might not always fit a rescue operation in a forest.

Representative example

Area coverage with multiple capacity-constrained robots: an exact formulation with strong guarantees, and a planning horizon that ends before the first drone leaves the ground.

Agarwal & Akella, IEEE RA-L 2022

The mismatch

Part one said the search changes while flying. A plan that must be complete before take-off cannot follow it.

  • Area Coverage With Multiple Capacity-Constrained Robots · Agarwal & Akella, IEEE Robotics and Automation Letters 7(2), 2022
Cooperative multi-robot control
Be generous to the centralized work; it is the yardstick on the results slide. The critique is about fit, not quality.
Task allocation · the problem

The allocation problem, formally

Assign Na drones to Nt tasks without conflicts, maximising a global goal under a set of constraints.

the objective

maximise  Σi Σj Fij(xij) the sum of every drone's local objective over the tasks it wins

subject to  H each task to at most one drone, plus the operational constraints on the right

formalised as a mixed-integer linear program (MILP)

No-fly zones

Airspace the plan may not enter, however cheap the path through it would be.

Time criticality

Some areas must be searched first; the objective discounts late arrival.

Energy limits

A bundle of tasks has to fit in one battery, or it is not a valid bundle.

Cooperative multi-robot control
Do not derive anything. The audience needs to see that the problem is a standard assignment problem with a twist in the constraints, so that "we solve it decentrally" lands as the interesting part.
Task allocation · the usual approach

Single-item auctions leave capacity on the table

The current approach: tasks are points or clusters of points, auctioned one at a time.

  • Points or clusters. The task model has no notion of a path, so a coverage line is a cluster of waypoints.
  • One task per round. Sequential single-item auctions converge, but slowly.
  • Suboptimal by design. An agent can almost always have acquired more tasks than the auction gave it.
  • Strong assumptions. Communication must be complete and situational awareness must be consistent across agents before the bids mean anything.

Centralized auction

One auctioneer collects every bid and announces every winner. Simple, and a single point of failure.

Decentralized auction

Every agent is its own auctioneer and the fleet has to agree on who won. Harder, and the only kind that survives losing the ground station.

Cooperative multi-robot control
The two cards on the right are the fork in the road. The source deck showed the same slide twice with an animation; the animation is the second card appearing.
Task allocation · our approach

Go decentralized, and bid on bundles

Decentralized algorithms buy robustness in an unstructured environment. The consensus-based bundle algorithm, CBBA, is the one we start from.

Robust where there is no structure

No node whose loss ends the mission, in a forest with no coverage.

Less overhead

No reliance on existing infrastructure; the drones are the network.

Ad hoc re-planning

A drone that lands to swap batteries triggers a re-bid, not a restart.

Dynamic task inclusion

New tasks join the auction as the operation changes, the way Part one said it would.

CBBA in one line

Each drone greedily builds a bundle of tasks it can serve cheaply, then the fleet reaches consensus on the winning bids. Decentralized, auction based, and it considers the whole bundle while bidding rather than one task at a time.

Cooperative multi-robot control
Four reasons, then the algorithm's name. The next slide shows how it works; this one only says why it is the right family.
Task allocation · CBBA

CBBA: build a bundle, then agree

Two phases repeat until nobody's bid changes: bundle construction on each drone, consensus between them.

Bundle construction

Agent i adds task j to its bundle b and path p whenever the reward S improves. It bids the marginal gain of adding that task where it fits best in the path.

Consensus

Neighbours exchange winning bids and who holds them. A set of consensus rules resolves every conflict locally, so the fleet agrees on who is winning and what the bid is, over any communication topology that changes while flying.

The condition: diminishing marginal gain

No task added to a bundle may decrease the cost of the whole bundle. A time-discounted reward satisfies this: adding a point to a path always adds time.

Two limits

Optimality is not guaranteed. And the original is limited to point tasks, while Part one produced lines.

  • Consensus-Based Decentralized Auctions for Robust Task Allocation · Choi, Brunet & How, IEEE Transactions on Robotics 25(4), 2009
Cooperative multi-robot control
Bid, share, resolve, repeat. Then point at the rust card: the second limit is the contribution of the next two slides.
Task allocation · the contribution

Trajectories, not points

A task becomes a path between two points, and which end you start from is part of what the allocator decides.

Left, point tasks joined by an incidental path. Right, directed trajectory tasks where the allocator also picks the traversal direction.
Point tasks against directed trajectory tasks. Figure from the ICAR 2023 talk.

Still satisfies diminishing marginal gain

The spatial difference between a line's start and end is what the bid scores, so CBBA's convergence carries over.

A task abstraction that generalises

Points, lines and areas (as line coverage) are all the same object to the allocator.

The price

Higher complexity, because tasks now depend on each other: the order in the path and the direction of traversal both change the cost.

Cooperative multi-robot control
Point at the arrows in the right panel of the figure: they are the contribution. A line has two ways to be flown, and the choice changes the cost of the next task in the bundle.
Task allocation · results

Within 5% of centralized, without the centre

Against a branch-and-bound MILP that knows everything in advance, the decentralized allocator gives up almost nothing.

A coverage plan from TrajAllocPy: line tasks laid over a rotated site polygon with buildings, one drone's path in magenta.
Line coverage tasks over a real site, allocated with TrajAllocPy. Replace with the results plots from the defence deck (near-optimal comparison and scaling curves).
< 5%

from near-optimal

Compared with centralized branch-and-bound MILP solutions on the same benchmark problems.

Scales with robots, less so with tasks

Adding drones is cheap. Adding tasks grows the bundle search, since each line can be flown two ways and slotted anywhere in the path.

Direction is optimised, not guessed

Each line task is scored in both directions before it enters a bundle.

Cooperative multi-robot control
Read the 5% and stop. If asked about the scaling, the honest answer is that task count is the axis that hurts, and the reason is the two traversal directions per line.
Part three

Swarm control through programming interfaces

Combining domain-specific knowledge with planning algorithms: two declarative languages between the operator and the mission.

Programming interfaces · the languages

Two languages between the operator and the swarm

High-level planning, automatic task generation and swarm monitoring, on top of a built-in UAV infrastructure of Gazebo, PX4 SITL and ROS.

Agent language

Describes what a drone is: its capabilities such as flight time and sensors, and the environmental conditions and limitations it operates under.

integrates environment and capability

Operation language

Describes what the operator wants: tasks and constraints in the operator's own terms. It is the translation layer between a human mission objective and its execution.

the operator's side of the contract

Why declarative

An operator states the goal and the rules, not the flight plan. The planner from Part two fills in the rest, and the same operation file runs in simulation and on aircraft.

high-level planningautomatic task generation swarm monitoringGazeboPX4 SITLROS
Cooperative multi-robot control
Two languages because two people write them: the integrator describes the aircraft once, the operator describes each mission. Show a snippet of the operation language if there is time.
Programming interfaces · the limit

Still one node holding the strings

The languages are decentralized by nature. The implementation was not, yet.

Dynamic re-planning

Handled, but governed centrally: one process re-runs the allocation.

Failure detection

Handled, but a single node watches every aircraft's heartbeat.

Communication

Handled over MAVLink, through the one node that maintains every connection.

Which sets the next requirement

The Operation language is inherently decentralized, but the solution still depends on a single node that maintains the connection using MAVLink. What is missing is a communication protocol without a single point of failure.

Cooperative multi-robot control
This is a self-critique slide and it should sound like one. The dark card is the motivation for Part four; read its last sentence as a question.
Part four

Communication without infrastructure

Simple broadcast messaging between aircraft, inexpensive, open source, and tested in the air.

Communication · the options

Nothing off the shelf fit

The requirements: an ad hoc network with decentralized communication, adaptable message formats, and hardware that is open and easy to get.

MAVLink

The standard drone protocol, and it does not support ad hoc drone-to-drone communication.

MQTT and Zigbee

Both need a centralized broker or coordinator, the very node we are trying to remove.

B.A.T.M.A.N.

A real mesh protocol, but it relies on the Linux kernel, so the hardware gets expensive.

LoRa

Long range, but proprietary and with data rates too low to carry bids and positions.

So we built one

Broadcast on the data link layer, on a microcontroller that costs about ten euros, with a message format the application defines.

Cooperative multi-robot control
Four rust cards, one reason each. Do not defend the choices at length; the next slide is the argument.
Communication · SwarmTalk

SwarmTalk: a €10 plug-and-play module

No central coordinator and no network configuration in advance. A commodity ESP32 broadcasting on 2.4 GHz.

Physical layer

2.4 GHz Wi-Fi radio on an off-the-shelf ESP32.

COTS

Protocol layer

ESP-NOW: lightweight, connectionless messaging on OSI layer 2. 1490-byte packets, about 372 floats each.

no association, no router

Application layer

A ROS 2 bridge that serialises messages to binary and back: positions, task assignments, status.

publish and subscribe

Open sourced, all of it

Firmware, example code, the ROS 2 middleware and a 3D-printable enclosure. Quick to prototype with and easy to extend.

≈ €10

per aircraft

The whole module. Cheap enough to put on every drone in a fleet and lose a few.

1,500 m

tested in the air

Successfully exchanged packets between airborne UAVs up to 1.5 km apart.

Cooperative multi-robot control
Hold the module up if you have one. The layered picture matters because the ROS 2 bridge is what makes it usable by the planner from Part two without anyone writing radio code.
Communication · outdoor performance

Tested in the air, up to 1.5 km

Two outdoor experiments with real aircraft, one for throughput at working range and one to find the edge.

0.16%

packet loss at 200 to 400 m

Three UAVs at 50 to 100 m altitude, exchanging positions continuously.

≈ 6%

packet loss out to 1,500 m

Two UAVs, packets at 2 Hz, range swept from 0 to 1.5 km.

Where it sits

Range: LoRa > SwarmTalk > Wi-Fi. Less reach than LoRa, far more data; more reach than infrastructure Wi-Fi, with no access point.

Range and packet-loss plots from the defence deck (source slides 30 and 31)
Outdoor experiments, ICUAS 2025.
Cooperative multi-robot control
Two numbers, two experiments. The 6% at 1.5 km is with a broadcast protocol and no retransmission, so say so before someone asks.
Communication · hardware in the loop

Consensus in under ten seconds, over the air

Parts two and four together: three simulated UAVs run the decentralized allocator, and every bid travels over real SwarmTalk radios.

< 10 s

to a conflict-free allocation

The three UAVs reached consensus on the task allocation in under ten seconds.

The radio is not the bottleneck

Throughput of 150 kbps against a theoretical maximum of 500 kbps: the allocator used about 30% of the available bandwidth.

What this closes

Slide 19 said the planner still hung off one MAVLink node. Here the same planner runs with no ground station in the loop at all: the drones bid, agree and fly on a network they carry themselves.

A platform for decentralized swarms

Commodity hardware at about €10 per aircraft, open-source firmware and middleware, and a planner that already speaks it. Enough to prototype a dynamic swarm in an afternoon.

Cooperative multi-robot control
This is the slide where two parts of the thesis touch. Say that explicitly. The bandwidth number is there to pre-empt "does it scale to more drones".
Part five

A dataset and benchmark for informed search

In search and rescue you want to look at the right places at the right time. Until now there was no shared way to say whether a planner does.

SAREnv · the gap

Four hundred papers a year and no shared yardstick

The field publishes heuristics faster than it agrees on how to describe the problem or the performance.

≈ 400

SAR publications last year

Of which roughly a hundred are within robotic path planning.

OpenAlex, keyword search-and-rescue

A lot of heuristics

Spirals, lawnmowers, greedy frontiers and learned policies, each evaluated on its own map with its own metric, so none of them can be compared.

The goal is ambiguous, except for one thing

What a SAR operation optimises is debatable. Finding the lost person is not. A benchmark has to be built around that, and around where lost people actually turn out to be.

Cooperative multi-robot control
The dark card is the design principle behind SAREnv: ground truth is a probability of where a person is, not a coverage percentage.
SAREnv · the dataset

SAREnv: lost-person behaviour as a dataset

An open-source dataset and benchmark tool for informed wilderness search and rescue with UAVs, built with the University of Bristol Flight Lab.

Lost-person behaviour

Statistical models of where people are found relative to where they were last seen.

Geospatial features

Roads, water, tree cover, buildings and terrain, the features that pull a lost person one way or another.

Predefined area sizes

Scenarios at fixed extents so results are comparable between papers.

Empirical statistics

The probabilities come from real incident data, and they generate the maps a planner is scored against.

60

geospatial scenarios

Across four distinct European environments, each with a high-resolution probability map.

What it is for

Use statistical data to generate data for path-planning algorithms, then score any planner the same way.

Cooperative multi-robot control
Name the Bristol collaboration; it is why the environments are European rather than Danish. The 60 scenarios are the thing a reviewer can download tonight.
SAREnv · probabilistic maps

Two independent distributions make a probability map

Where a person is likely to be is the product of how far they tend to travel and what kind of ground they tend to end up on.

the model

P(area)  ∝  Pspatial(x, y) · Pfeature(f(x, y)) a continuous spatial probability function, times a discrete distribution over the feature under each cell, assumed statistically independent

Spatial distribution

Distance from the last known position, from lost-person statistics.

Feature distribution

How often people are found on a road, by water, in dense forest, in a building.

Probability map render from the defence deck (source slide 36)
A SAREnv probability map over one of the four environments.
Cooperative multi-robot control
The independence assumption is the thing to own: it is what makes the map computable from two published statistics rather than a joint model nobody has data for.
SAREnv · performance metrics

Three metrics for one question

Did the search look at the right places at the right time? Each metric answers a stricter version of it.

PoD

Accumulated probability of detection

How much of the probability mass the path has seen. Rewards complete coverage of likely ground.

TD-PoD

Time-discounted probability

The same mass, discounted by when it was seen. Rewards looking in the likely places first.

LPDS

Lost person discovery score

How quickly sampled lost persons, drawn from the map, are actually found. The one that reads like an operation.

Why three

A planner can score well on coverage and badly on time, or find the sampled people by luck. Reporting all three is what makes two papers comparable.

Cooperative multi-robot control
The source deck spent three slides on these; one is enough if you say the key word on each: complete, first, found.
SAREnv · baselines and results

Five baselines, one benchmark

Predefined coverage patterns give every future planner something to beat, on the same maps with the same metrics.

SpiralConcentric circlesPizza zigzag GreedyRandom exploration

What the comparison shows

The informed planners, those that read the probability map, separate from the uninformed patterns most on the time-discounted metric. Coverage alone hides the difference. Confirm against the results plot on source slide 41.

The benchmark is the contribution

Not the baselines' scores, but that any planner published after this can report the same three numbers on the same sixty scenarios.

Baseline pattern gallery and performance plot from the defence deck (source slides 40 and 41)
Baseline coverage patterns and their scores, SAREnv.
Cooperative multi-robot control
If the plot is on screen, point at the gap on the time-discounted axis. If it is not yet, say the sentence in the first card and move on.
Part six

Contributions and where this goes

Six peer-reviewed papers, a handful of side quests, and the questions the thesis leaves open.

Contributions · publications

Six peer-reviewed papers

One per component, plus the project paper that started it.

The HERD project

Human multi-robot interaction in search and rescue and in farming. Christensen, Grøntved et al., Human-Multi-Robot Systems Workshop, Kyoto 2022.

context

Automated task generation

For multi-drone search and rescue operations. Grøntved, Christensen & Bahodi, DCAI 2025, Springer.

part one

Trajectory task allocation

Decentralized multi-UAV trajectory task allocation in search and rescue applications. Grøntved, Lundquist & Christensen, ICAR 2023, IEEE.

part two

U-space operation planning

Towards autonomous multi-UAV U-space operation planning. Grøntved, Jepsen, Christensen, Jensen, Schultz Lundquist & Campusano, ICUAS 2024, IEEE.

part three

Communication for UAV swarms

An open-source, low-cost solution based on ESP-NOW. Grøntved, Ladig & Christensen, ICUAS 2025, IEEE.

part four

SAREnv

An open-source dataset and benchmark tool for informed wilderness search and rescue using UAVs. Grøntved, Jarabo-Peñas, Reid, Rolland, Watson, Richards, Bullock & Christensen, Drones 9(9), MDPI 2025.

part five
Cooperative multi-robot control
Do not read the citations. Point at the cap on each card: one paper per part of the talk. The full references are under r.
Contributions · other work

Side quests that fed back in

User studies with rescue operators, and the same swarm tools pointed at animals and volcanoes.

Human-swarm interaction in search and rescue

Drone swarms to support search and rescue operations: opportunities and challenges (Cultural Robotics, Springer 2023). Before it falls: supporting drone fleet management through battery visualisations (INTERACT 2025).

with Hoang, Bahodi, van Berkel, Skov, Merritt, Lau

Wildlife and environmental monitoring

Drone swarms for animal monitoring: multi-perspective data collection (IMAV 2024) and field trials on large mammals (PAAMS 2025). Autonomous UAV volcanic plume sampling based on machine vision and path planning (ICUAS 2024).

with Rolland, Laporte-Devylder, Kline, Meier, Maalouf, Watson, Richardson

Why they belong in a SAR thesis

Every one of them exercised the same toolchain: TrajGenPy for paths, TrajAllocPy for allocation, SwarmTalk in the air. A zebra herd and a volcanic plume are search problems with a different target.

Cooperative multi-robot control
One sentence per column, then the dark card. The backup slides at the end have detail on the plume and the zebras if the committee wants it.
Conclusion

Bridging theory and real-world SAR operations

Decentralized cooperative control can be realised in operational UAV systems. The thesis delivers the components of a complete toolchain to do it, each open source.

Trajectory-based CBBA

Decentralized task allocation over lines and areas, within 5% of centralized optima.

TrajAllocPy

Infrastructure-less communication

On physical platforms, at €10 per aircraft, consensus over the air in under ten seconds.

SwarmTalk

Domain-aware planning and evaluation

Task generation from the OFS procedure, path generation, and a benchmark built on lost-person behaviour.

TrajGenPy · SAREnv

An operator-centric language

Operations described in the operator's terms, executed by the planner.

Operation language

Key results

Robust methods for autonomous, cooperative multi-UAV search and rescue. A standardised evaluation framework that makes the research reproducible and comparable. And an open-source release of every tool and dataset, so the next validation can happen in the field rather than the lab.

Four cards, four parts, then the dark card. Then stop; the next slide is the future work and it should feel like a separate breath.
Future work

Is search and rescue trivial now? No.

Four directions, in the order the emergency agency would ask for them.

Real-world end-to-end tests

Close collaboration with DEMA is still needed to validate the methods on live operations. Interaction with the humans running them is what decides whether the technology is adopted.

Dynamic and reactive planning

From static to dynamic task models: moving targets, evolving uncertainty, even patrolling. Reactive planning for time-critical search, where the human and the UAV plan together.

Heterogeneous teams

Mixed teams of UAVs, ground units and manned aircraft, with communication and allocation protocols that understand different capabilities.

Interaction and learning

LLM agents for natural, adaptive mission specification and operator control. SAREnv's metrics as a training signal for learned search strategies.

The one to start with

End-to-end field tests with the agency. Every other item on this slide is easier to justify once a real operation has run on the toolchain.

Cooperative multi-robot control
Open the floor from here. If the discussion stalls, the LLM card is the one everybody has an opinion on.
Appendix

Backup slides

Detail for questions: the volcano, the zebras, the interface work, and the coverage problem after this one.

Backup · environmental monitoring

Volcanic plume interception

The swarm tooling pointed at a plume instead of a person: machine vision finds it, path planning flies through it.

  • Software-in-the-loop in a container. VS Code workspaces wrap Gazebo and PX4 so a realistic flight-dynamics simulation starts with one command.
  • Fast prototyping. The same workspace ran the plume-interception controller before it flew.
  • YOLOv8 for detection. The plume is a visual target; the interception path is planned from the detection.
Plume interception figure from the defence deck (source slide 47)
Autonomous UAV volcanic plume sampling, ICUAS 2024.
Cooperative multi-robot control
Only if asked. The point is transfer: nothing SAR-specific had to change.
Backup · environmental monitoring

Monitoring a herd is an art-gallery problem

Monitor as many surfaces as possible using the fewest resources.

The optimisation

Treat every animal as a Lambertian surface and maximise the radiated "light" of the entire herd of zebras that the cameras collect. Camera placement becomes a guarding problem over moving surfaces.

Why it is the same toolchain

Viewpoints are tasks, the herd is the search area, and the drones allocate them between themselves the way they allocate coverage lines.

Herd monitoring figure from the defence deck (source slide 48)
Multi-perspective monitoring of large mammals, IMAV 2024 and PAAMS 2025.
Cooperative multi-robot control
Only if asked.
Backup · human-swarm interaction

Situational awareness for the operator

The operator from slide 5 is still there. The interface work is about what they see.

UI components

Fleet state, task state and battery state in one view rather than one tablet per aircraft.

Notifications

The system raises what changed; the operator does not have to poll.

Improved human situational awareness

Measured in user studies with operators, not assumed.

  • Before It Falls: Supporting Drone Fleet Management Through Battery Visualizations · Bahodi, Lau, van Berkel, Grøntved, Skov & Merritt, INTERACT 2025
Cooperative multi-robot control
Only if asked about the human side.
Backup · what comes after SAREnv

Probabilistic multi-agent coverage

Cover a known area, distributing the agents most effectively given a distribution of known priors.

  • Operator in the loop. Change the mission parameters while flying: priorities, focus of search.
  • A dynamic environment. The map changes and the plan follows.
  • Multi-agent reinforcement learning. Long-term coordination learned rather than scripted.

Open questions

How to represent the environment to a learner, how to model the other agents, and what SAREnv's metrics look like as a reward.

Cooperative multi-robot control
Only if asked where the learning direction from the future-work slide goes concretely.