DSDavid Saldaña

David Saldaña

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


David Saldaña has a total of 44 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • From Hitch to Lift: Autonomous Cable Interlacing by Multi-UAV Teams for Aerial Grasping and Transportation

    by Diego S. D'ANtonio, Tongshu Wu, Subhrajit Bhattacharya, David Saldaña

    The use of cables in aerial manipulation offers a lightweight and flexible alternative to rigid grasping mechanisms. However, achieving autonomous tying and secure transportation of objects with cables remains a significant challenge. In this work, we present a novel method for autonomously securing and transporting objects using multi-layer hitches formed in midair by a team of aerial robots. Building upon prior work on polygonal hitch formation, we extend the framework to include layered cable interlacing that increases frictional grip and enables secure object grasping. We introduce two new manipulation actions: multi-layer tying and autonomous object release, completing the pipeline for aerial grasping and transportation. We develop a capstan-based analytical model that establishes an exponential scaling law for the effect of cable layers and provides a conservative guideline. The formation algorithm operates in parallel, ensuring scalability to large teams with constant execution time. We validate our system through simulation and hardware experiments, demonstrating fully autonomous object tying, lifting, and releasing using cables alone without human intervention.

  • Decentralized Adaptive Aerospace Transportation of Unknown Loads Using A Team of Robots

    by Longsen Gao, Kevin Aubert, David Saldaña, Claus Danielson, Rafael Fierro


  • quasi-Dynamic Crowd Vetting: Collaborative Detection of Malicious Robots in Dynamic Communication Networks

    by Matthew Cavorsi, Frederik Mallmann-Trenn, David Saldaña, Stephanie Gil

    We are interested in the problem where robots traverse through an environment modeled by a graph of discrete sites, and an unknown subset of the multirobot team is malicious. Previous works require that each robot gathers information about the trustworthiness of all other robots, called trust observations, which can be time consuming in large networks. This article decreases the time required to estimate trustworthiness by building upon an algorithm that leverages the concept of “crowd vetting” and the opinion of trusted neighbors. This allows each robot to estimate trust in dynamic scenarios, where the team size, robot neighborhoods, and robot legitimacy can change. In particular, we employ an assumption that there exists quasi-dynamic time periods, where if a robot’s legitimacy remains fixed for a sufficient length of time, its trustworthiness can be characterized. In this setting, we develop a closed-form expression for the critical number of time-steps required for our algorithm to successfully identify the true legitimacy of each robot within a specified failure probability. We show that the number of time-steps required for robots to correctly estimate the trust of all other robots increases logarithmically with the number of robots when robots do not leverage neighboring opinions, called the direct protocol. Conversely, for most general graph topologies, the number of time-steps required remains constant as the number of robots increases when our proposed algorithm, called quasi-dynamic crowd vetting (DCV), is used, for a fixed ratio of legitimate to malicious robots. Finally, our theoretical results are successfully validated through simulated persistent surveillance tasks where robots maintain a desired distribution of robots over sites in the environment.

  • Modular Multirotors: From Quadrotors to Fully-Actuated Aerial Vehicles

    by Jiawei Xu, Diego S. D'ANtonio, David Saldaña

    Traditional aerial vehicles are constrained to perform specific tasks due to their adhoc designs. Based on modularity, we propose a versatile robot, H-ModQuad, that can adapt to different tasks by increasing its load capacity and actuated degrees of freedom. It is composed of cuboid modules propelled by quadrotors with tilted rotors. We present two families of module designs that bring scalable and versatile actuation to the aerial systems. By configuring multiple modules, H-ModQuad can increase its payload capacity and change its actuated degrees of freedom from 4 to 5 and 6. By modeling the actuation capability of H-ModQuad using actuation ellipsoids and wrench polytopes, we find the body frame of a vehicle that maximizes its thrusting efficiency. We also compare the vehicle capabilities against formally defined task requirements. We present the dynamics of H-ModQuad and integrate control strategies despite the vehicle design. The design and model are validated with experiments using actual robots, showing that H-ModQuad vehicles with different configurations provide different actuation properties.


  • Reconfigurable Systems

    by David Saldaña, Gedaliah Knizhnik, Bruno Gabrich, Mark Yim

  • Top Cited Papers

    AirBender: Adaptive Transportation of Bendable Objects Using Dual UAVs

    by Jiawei Xu, Longsen Gao, Rafael Fierro, David Saldaña

    The interaction of robots with bendable objects in midair presents significant challenges in control, often resulting in performance degradation and potential crashes, especially for aerial robots due to their limited actuation capabilities and constant need to remain airborne. This letter presents an adaptive controller that enables two aerial vehicles to collaboratively follow a trajectory while transporting a bendable object without relying on explicit elasticity models. Our method allows on-the-fly adaptation to the object's unknown deformable properties, ensuring stability and performance in trajectory-tracking tasks. We use Lyapunov analysis to demonstrate that our adaptive controller is asymptotically stable. Our method is evaluated through hardware experiments in various scenarios, demonstrating the capabilities of using multirotor aerial vehicles to handle bendable objects.


  • Open Access

    Modular Multi-Rotors: From Quadrotors to Fully-Actuated Aerial Vehicles

    by Jiawei Xu, Diego S. D’antonio, David Saldaña

    Traditional aerial vehicles are constrained to perform specific tasks due to their adhoc designs. Based on modularity, we propose a versatile robot, H-ModQuad, that can adapt to different tasks by increasing its load capacity and actuated degrees of freedom. It is composed of cuboid modules propelled by quadrotors with tilted rotors. We present two families of module designs that bring different actuation characteristics to the system. By configuring multiple modules, H-ModQuad can increase its payload capacity and change its actuated degrees of freedom from 4 to 5 and 6. Using the concept of actua-tion ellipsoids, we find the body frame of an H-ModQuad that maximizes the thrust for hovering. By modeling the actuation capability of the vehicles using wrench polytopes, we examine them against formally defined task requirements. We present the dynamics of the vehicles and integrate control strategies despite vehicle design. The design and model are validated with experiments using actual robots, showing that H-ModQuad vehicles with different configurations provide different actuation properties.


  • Open Access

    A Novel Low-Cost, Recyclable, Easy-to-Build Robot Blimp For Transporting Supplies in Hard-to-Reach Locations

    by Karen Li, Shuhang Hou, Matyas Negash, Jiawei Xu, Edward Jeffs, Diego S. D'Antonio, David Saldaña

    Rural communities in remote areas often encounter significant challenges when it comes to accessing emergency healthcare services and essential supplies due to a lack of adequate transportation infrastructure. The situation is further exacerbated by poorly maintained, damaged, or flooded roads, making it arduous for rural residents to obtain the necessary aid in critical situations. Limited budgets and technological constraints pose additional obstacles, hindering the prompt response of local rescue teams during emergencies. The transportation of crucial resources, such as medical supplies and food, plays a vital role in saving lives in these situations. In light of these obstacles, our objective is to improve accessibility and alleviate the suffering of vulnerable populations by automating transportation tasks using low-cost robotic systems. We propose a low-cost, easy-to-build blimp robot (UAVs), that can significantly enhance the efficiency and effectiveness of local emergency responses.

  • Learning to Navigate in Turbulent Flows With Aerial Robot Swarms: A Cooperative Deep Reinforcement Learning Approach

    by Diego Patiño, Siddharth Mayya, Juan Calderon, Kostas Daniilidis, David Saldaña

    Aerial operation in turbulent environments is a challenging problem due to the chaotic behavior of the flow. This problem is made even more complex when a team of aerial robots is trying to achieve coordinated motion in turbulent wind conditions. In this letter, we present a novel multi-robot controller to navigate in turbulent flows, decoupling the trajectory-tracking control from the turbulence compensation via a nested control architecture. Unlike previous works, our method does not learn to compensate for the air-flow at a specific time and space. Instead, our method learns to compensate for the flow based on its effect on the team. This is made possible via a deep reinforcement learning approach, implemented via a Graph Convolutional Neural Network (GCNN)-based architecture, which enables robots to achieve better wind compensation by processing the spatial-temporal correlation of wind flows across the team. Our approach scales well to large robot teams —as each robot only uses information from its nearest neighbors—, and generalizes well to robot teams larger than seen in training. Simulated experiments demonstrate how information sharing improves turbulence compensation in a team of aerial robots and demonstrate the flexibility of our method over different team configurations.


  • Open Access

    Dynamic Crowd Vetting: Collaborative Detection of Malicious Robots in Dynamic Communication Networks

    by Matthew Cavorsi, Frederik Mallmann-Trenn, David Saldaña, Stephanie Gil

    Coordination in a large number of networked robots is a challenging task, especially when robots are constantly moving around the environment and there are malicious attacks within the network. Various approaches in the literature exist for detecting malicious robots, such as message sampling or suspicious behavior analysis. However, these approaches require every robot to sample every other robot in the network, leading to a slow detection process that degrades team performance. This paper introduces a method that significantly decreases the detection time for legitimate robots to identify malicious robots in a scenario where legitimate robots are randomly moving around the environment. Our method leverages the concept of ``Dynamic Crowd Vetting" by utilizing observations from random encounters and trusted neighboring robots' opinions to quickly improve the accuracy of detecting malicious robots. The key intuition is that as long as each legitimate robot accurately estimates the legitimacy of at least some fixed subset of the team, the second-hand information they receive from trusted neighbors is enough to correct any misclassifications and provide accurate trust estimations of the rest of the team. We show that the size of this fixed subset can be characterized as a function of fundamental graph and random walk properties. Furthermore, we formally show that as the number of robots in the team increases the detection time remains constant. We develop a closed form expression for the critical number of time-steps required for our algorithm to successfully identify the true legitimacy of each robot to within a specified failure probability. Our theoretical results are validated through simulations demonstrating significant reductions in detection time when compared to previous works that do not leverage trusted neighbor information.