Pasar al contenido principal

MANIPULACION DINAMICA NO RIGIDA CON SISTEMAS MULTIAGENTE

PID2024-159279OB-I00

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal para la Investigación y el Desarrollo Experimental
Subprograma Subprograma Estatal de Generación de Conocimiento Científico-Técnico y Desarrollo Experimental
Convocatoria Proyectos de I+D+i (Generación de Conocimiento y Retos Investigación)
Año convocatoria 2024
Plan Estatal 2024-2027 Plan Estatal de Investigación Científica y Técnica y de Innovación
Centro beneficiario UNIVERSIDAD DE ZARAGOZA

Resultados relacionados

Resultados totales (Incluyendo duplicados): 4
Encontrada(s) 1 página(s)

Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publicación Artículo científico (JournalArticle)

Hierarchical parameter estimation for distributed networked systems: A dynamic consensus approach

  • Méndez-Castillo, Ariana
  • Aldana-López, Rodrigo
  • Ramírez-Treviño, Antonio
  • Aragüés, Rosario
  • Gómez-Gutiérrez, David
This work introduces a novel two-stage distributed framework to globally estimate constant parameters in a networked system, separating shared information from local estimation. The first stage uses dynamic average consensus to aggregate agents’ measurements into surrogates of centralized data. Using these surrogates, the second stage implements a local estimator to determine the parameters. By designing an appropriate consensus gain, the persistence of excitation of the regressor matrix is achieved, and thus, exponential convergence of a local Gradient Estimator (GE) is guaranteed. The framework facilitates its extension to switched network topologies, quantization, and the heterogeneous substitution of the GE with a Dynamic Regressor Extension and Mixing (DREM) estimator, which supports relaxed excitation requirements.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publicación Artículo científico (JournalArticle)

Robotic perception and manipulation of deformable linear objects: A survey

  • Caporali, Alessio
  • Cuiral-Zueco, Ignacio
  • López-Nicolás, Gonzalo
  • Palli, Gianluca
Deformable linear objects (DLOs) are widely encountered in everyday life, taking forms such as plastic tubes, wires, ropes, and cables. They are prevalent across diverse settings, including industrial, domestic, and medical environments, as well as in outdoor applications like electric power lines, subaquatic cables, and aerial transport systems. These objects are termed deformable due to their ability to undergo significant shape changes under external forces, and linear because their length vastly exceeds their cross-sectional dimensions. Despite their importance and widespread presence, developing robotic systems capable of interacting with DLOs poses numerous challenges. This survey presents a comprehensive review of the state-of-the-art methods developed over the past decade to address these challenges. It covers key areas including physical and data-driven modeling techniques, simulation environments, perception approaches based on vision and tactile sensing, as well as strategies for estimation, planning, and control. It also reviews common manipulation tasks such as grasping, shaping, routing, knotting, suturing, and transport. The survey concludes with a critical discussion of current limitations and outlines promising directions for future research.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publicación Artículo científico (JournalArticle)

Super-twisting over networks: A Lyapunov approach for distributed differentiation

  • Aldana-López, Rodrigo
  • Pérez-Salesa, Irene
  • Gómez-Gutiérrez, David
  • Aragüés, Rosario
  • Sagüés, Carlos
We study distributed differentiation, where agents in a networked system estimate the average of local time-varying signals and their derivatives under mild assumptions on the agents’ signals and their first and second derivatives. Existing sliding-mode methods provide only local stability guarantees and lack systematic gain selection. By isolating the structural features shared with the super-twisting algorithm and encoding them into an abstract model, we construct a Lyapunov function that enables systematic gain design and proves global finite-time convergence to consensus for the distributed differentiator. Building on this framework, we develop an event-triggered implementation using time-varying and state-dependent threshold rules, and derive minimum inter-event time guarantees and accuracy bounds that quantify the trade-off between estimation accuracy and communication effort for the networked system.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publicación Artículo científico (JournalArticle)

Towards Step-size-free Distributed Optimization: a Port-Hamiltonian Approach

  • Aldana-López, Rodrigo
  • Macchelli, Alessandro
  • Notarstefano, Giuseppe
  • Aragüés, Rosario
  • Sagüés, Carlos
This paper presents a novel distributed optimization technique that, under suitable assumptions on problem and communication graph, is able to operate with any step-size parameter, a capability not evident in previous methods. Traditionally, selecting the step-size in distributed optimization often leads to a conservative performance, resulting in slow convergence or even divergence if the step-size is incorrectly chosen. In this work, we propose a systems theory approach based on the port-Hamiltonian formalism to develop algorithms for consensus optimization problems. Starting from a continuous-time flow, we propose a distributed algorithm based on a discretized Port-Hamiltonian system that works regardless of the step size. Additionally, we introduce Mixed Implicit Discretization, which lowers communication overhead while maintaining, under suitable conditions, the ability to converge with any step size. This feature is formally verified in specific scenarios and demonstrated experimentally in general cases with large step sizes. These results illustrate that the proposed method can utilize step sizes several orders of magnitude larger than those in previous work, where conventional methods fail, ultimately enhancing convergence speed.