paper-with-me

홈 › Papers

Attainable Force Approximation and Full-Pose Tracking Control of an Over-Actuated Thrust-Vectoring Modular Team UAV

2024-10-04 · Yen-Cheng Chu, Kai-Cheng Fang, Feng-Li Lian

Traditional vertical take-off and landing (VTOL) aircraft can not achieve optimal efficiency for various payload weights and has limited mobility due to its under-actuation. With the thrust-vectoring mechanism, the proposed modular team UAV is fully actuated at certain attitudes. However, the attainable force space (AFS) differs according to the team configuration, which makes the controller design difficult. We propose an approximation to the AFS and a full-pose tracking controller with an attitude planner and a force projection, which guarantees the control force is feasible. The proposed approach can be applied to UAVs having multiple thrust-vectoring effectors with homogeneous agents. The simulation and experiment demonstrate a tilting motion during hovering for a 4-agent team.

📄 PDF Abstract BibTeX arXiv:2410.03445

Code (0)

등록된 구현이 없습니다.

Tasks

Pose Tracking

Similar Papers 제목 키워드 기반

Improved Extended Kalman Filter-Based Disturbance Observers for Exoskeletons

2025-10-17 · Shilei Li, Dawei Shi, Makoto Iwasaki, Yan Ning 외 arxiv

The nominal performance of mechanical systems is often degraded by unknown disturbances. A two-degree-of-freedom control structure can decouple nominal performance from disturbance rejection. However, perfect disturbance…

Renegotiation-Proof Cheap Talk

2025-02-12 · Steven Kivinen, Christoph Kuzmics

An informed Advisor and an uninformed Decision-Maker engage in repeated cheap talk communication in always new (stochastically independent) decision problems. They have a conflict of interest over which action should be …

Logarithmic Regret for Reinforcement Learning with Linear Function Approximation

2020-11-23 · Jiafan He, Dongruo Zhou, Quanquan Gu

Reinforcement learning (RL) with linear function approximation has received increasing attention recently. However, existing work has focused on obtaining $\sqrt{T}$-type regret bound, where $T$ is the number of interact…

reinforcement-learningReinforcement LearningReinforcement Learning (RL)

Online Learning with Costly Features and Labels

2013-12-01 · NeurIPS 2013 12 · Nicolò Cesa-Bianchi, Ofer Dekel, Ohad Shamir

We study the power of different types of adaptive (nonoblivious) adversaries in the setting of prediction with expert advice, under both full-information and bandit feedback. We measure the player's performance using a n…

Online Learning with Switching Costs and Other Adaptive Adversaries

2013-02-18 · NeurIPS 2013 12 · Nicolo Cesa-Bianchi, Ofer Dekel, Ohad Shamir

We study the power of different types of adaptive (nonoblivious) adversaries in the setting of prediction with expert advice, under both full-information and bandit feedback. We measure the player's performance using a n…