Titlebook: Algorithms for Sensor Systems; 16th International S Cristina M. Pinotti,Alfredo Navarra,Amitabha Bagch Conference proceedings 2020 Springer

引導(dǎo)

合乎習(xí)俗

squander

盡忠

異端邪說下

Covering Users by a Connected Swarm Efficiently,o place a set of UAVs that should cover a given set of planar users under some constraints and we want to maintain the solution efficiently in a static and dynamic fashion. Specifically, for a set . of . non-negative weighted points in the plane, we consider a set . of . disks (or squares) of radius

minion

: A Traveling Salesperson Problem with Racetrack-Like Acceleration Constraints, inspired from the pen-and-pencil game . (also known as .). In contrast to other versions of TSP accounting for physical constraints, such as Dubins TSP, the spirit of this model is that (1) no speed limitations apply, and (2) inertia depends on the current velocity. As such, this model is closer to

precede

制度

On Efficient Connectivity-Preserving Transformations in a Grid, a linear-strength mechanism which enables it to move a whole line of consecutive devices in a single time-step. We study the problem of transforming . into a given connected target shape . of the same number of devices, via a finite sequence of .. Our focus is on designing . transformations aiming

細(xì)查

PRE

Asynchronous Filling by Myopic Luminous Robots,m, the robots enter the graph one-by-one through a specific vertex, called the Door, and they eventually have to cover all vertices of the graph while avoiding collisions. The robots are anonymous and make decisions driven by the same local rule of behavior. They have limited persistent memory and l