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

Christian Raffelsberger

dblp:120/9990 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
1since 2021 · last 2025
0000-0002-8366-144XORCID · corroborated

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

Computer networks · 2 · 1 since 2021

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
1 paper
Multi-agent systems · 67% Legged, aerial and field robots · 33%
Theoretical computer science
1 paper
Mathematical optimization · 100%
Computer networks
1 paper
Wireless networking · 100%

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

TopicWeightPapersLastEvidence papers
Robotics › Legged, aerial and field robots
aerial robots
0.912025
Real-time Adaptive Planning for Intelligent Distributed TSP-inspired Drone Swarming (RAPID-TSP) · MobiSys 2025
Knowledge, reasoning and agents › Multi-agent systems › task allocation
distributed task allocation
0.912025
Real-time Adaptive Planning for Intelligent Distributed TSP-inspired Drone Swarming (RAPID-TSP) · MobiSys 2025
Knowledge, reasoning and agents › Multi-agent systems
multi-robot coordination
0.912025
Real-time Adaptive Planning for Intelligent Distributed TSP-inspired Drone Swarming (RAPID-TSP) · MobiSys 2025
Mathematical optimization › combinatorial optimization › vehicle routing
traveling salesman problem
0.912025
Real-time Adaptive Planning for Intelligent Distributed TSP-inspired Drone Swarming (RAPID-TSP) · MobiSys 2025
Wireless networking › mobile ad hoc networks
connectivity maintenance
0.312025
Real-time Adaptive Planning for Intelligent Distributed TSP-inspired Drone Swarming (RAPID-TSP) · MobiSys 2025

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

distributed coordination algorithm · 2.6conflict resolution · 2.6
YearPublicationVenuePosition
2025 Real-time Adaptive Planning for Intelligent Distributed TSP-inspired Drone Swarming (RAPID-TSP)
abstract
This paper presents RAPID-TSP, a distributed coordination algorithm for multi-drone scanning missions in dynamic environments. It enables drones to balance area coverage efficiency with network connectivity by leveraging a tunable parameter λ. This parameter allows each drone to adaptively choose its next scanning target based on proximity and the positions of neighboring drones, while aiming to maintain connectivity with a base station for mission updates. RAPID-TSP incorporates conflict resolution and supports two swarming strategies to minimize redundant scanning and ensure efficient collaboration. A realistic scenario involving the scanning of container stacks in a logistics hub serves as evaluation scenario. Extensive simulations show how RAPID-TSP performs robustly under varying conditions and can reduce mission completion time by up to 40% compared to traditional mTSP coordination methods. A key design insight is that mission time is significantly reduced by adding more drones only when communication range is sufficient; otherwise, sparse connectivity limits their effectiveness.
Samira Hayat, Christian Raffelsberger
MobiSys2
2020 Application-Layer Coding with Intermittent Feedback Under Delay and Duty-Cycle Constraints
abstract
We propose two application-layer coding schemes for delay-constrained point-to-point packet communications with restrictions on the transmitter's maximum duty-cycle. The schemes operate over GF(2) and utilize intermittently available receiver feedback for erasure correction. Applications that will benefit from the proposed schemes include wireless sensor networks in which energy constrained sensors must deliver readings to a gateway within a deadline. Simulation results for independent Bernoulli erasure channels, Gilbert-Elliott channels, and Long Range (LoRa) communications demonstrate orders-of-magnitude reductions in the delivery failure rate as compared to feedback-assisted repetition redundancy and a blind coding scheme that does not utilize feedback.
Siddhartha S. Borkotoky, Udo Schilcher, Christian Raffelsberger
ICC3