A5012843243- Computational Geometry and Mesh Generation
- Music and Audio Processing
- Music Technology and Sound Studies
- Robotic Path Planning Algorithms
- Data Management and Algorithms
- Optimization and Search Problems
- Digital Image Processing Techniques
- Facility Location and Emergency Management
- Spanish Literature and Culture Studies
- Distributed Control Multi-Agent Systems
- Neuroscience and Music Perception
- UAV Applications and Optimization
- Optimization and Packing Problems
- graph theory and CDMA systems
- Modular Robots and Swarm Intelligence
- Musicology and Musical Analysis
- Vehicle Routing Optimization Methods
- Advanced Numerical Analysis Techniques
- Advanced Graph Theory Research
- Mathematics and Applications
- Theater, Performance, and Music History
- Complexity and Algorithms in Graphs
- Diverse Musicological Studies
- Robotics and Sensor-Based Localization
- Point processes and geometric inequalities
Universidad de Sevilla
2015-2024
This paper presents a novel approach to efficiently parameterize and estimate the state of hanging tether for path trajectory planning UGV tied UAV in marsupial configuration. Most implementations art assume taut or make use catenary curve model shape tether. The is complex compute must be instantiated thousands times during process, becoming time-consuming task, while assumption simplifies problem, but might overly restrict movement platforms. In order accelerate this proposes defining an...
Given a rectangular grid graph with special vertex at corner called base station, we study the problem of covering vertices entire tours that start and end station whose lengths do not exceed given threshold, while minimizing quality measure. We consider two objective functions: number sum their lengths. present an algorithm computes optimal solution for both objectives in linear time respect to size.
This paper presents the decentralized strategy followed to ensure information propagation in area monitoring missions with a fleet of heterogeneous UAVs limited communication range. The goal team is detect pollution sources over large as soon possible. Hence elapsed time between two consecutive visits should be minimized. On other hand, order exploit capabilities derived from having UAVs, an efficient partition performed distributed manner using one-to-one coordination schema according...
Flamenco is a music tradition from Southern Spain that attracts growing community of enthusiasts around the world. Its unique melodic and rhythmic elements, typically spontaneous improvised interpretation, its diversity regarding styles make this still largely undocumented art form particularly interesting material for musicological studies. In prior works, it has already been demonstrated research on computational analysis flamenco music, despite being relatively new field, can provide...
In monitoring missions, using a cooperative team of Unmanned Aerial Vehicles (UAVs), the goal is to minimize elapsed time between two consecutive observations any point in area. Techniques based area partitioning achieve when sub-area assigned each UAV according its capabilities. previous work authors [1] it was presented one-to-one strategy obtain decentralized way near optimal partition from initial grid partition. this paper generalization that called block-sharing technique presented....
This paper addresses a synchronization problem that arises when team of robots needs to communicate while repeatedly performing assigned tasks in cooperative scenario. Each robot has limited communication range and moves along previously defined closed trajectory. When two are close enough, link may be established, allowing the exchange information. The goal is schedule motions such entire system can synchronized for maximum information exchange; is, every pair neighbors always visit...
Given a set of n points S in the Euclidean plane, we address problem computing an annulus A, (open region between two concentric circles) largest width, that partitions into subset inside and outside circles, such no point p∈S lies interior A. This can be considered as maximin facility location for is circumference. We give characterization centres annuli which are locally optimal show solved O(n 3 log n) time O (n) space. also consider case number inner circle fixed value k. When k∈O(n) our...