English
Related papers

Related papers: Motion Accuracy and Computational Effort in QP-bas…

200 papers

The purpose of this paper is to solve the 0-1 $k$-item quadratic knapsack problem $(kQKP)$, a problem of maximizing a quadratic function subject to two linear constraints. We propose an exact method based on semidefinite optimization. The…

Optimization and Control · Mathematics 2020-07-13 Lucas Létocart , Angelika Wiegele

Control pulses that nominally optimize fidelity are sensitive to routine hardware drift and modeling errors. Robust quantum optimal control seeks error-insensitive control pulses that maintain fidelity thresholds and obey hardware…

Soft robotics holds transformative potential for enabling adaptive and adaptable systems in dynamic environments. However, the interplay between morphological and control complexities and their collective impact on task performance remains…

Robotics · Computer Science 2025-03-27 Yue Xie , Kai-fung Chu , Xing Wang , Fumiya Iida

Quadratically constrained quadratic programming (QCQP) has long been recognized as a computationally challenging problem, particularly in large-scale or high-dimensional settings where solving it directly becomes intractable. The complexity…

Optimization and Control · Mathematics 2025-10-09 Shuai Li , Shenglong Zhou , Ziyan Luo

We present ReLU-QP, a GPU-accelerated solver for quadratic programs (QPs) that is capable of solving high-dimensional control problems at real-time rates. ReLU-QP is derived by exactly reformulating the Alternating Direction Method of…

Robotics · Computer Science 2023-12-01 Arun L. Bishop , John Z. Zhang , Swaminathan Gurumurthy , Kevin Tracy , Zachary Manchester

We propose an SQP algorithm for mathematical programs with vanishing constraints which solves at each iteration a quadratic program with linear vanishing constraints. The algorithm is based on the newly developed concept of $\mathcal…

Optimization and Control · Mathematics 2016-11-28 Matúš Benko , Helmut Gfrerer

Quantum computing proposes a revolutionary paradigm that can radically transform numerous scientific and industrial application domains. To realize this promise, these new capabilities need software solutions that are able to effectively…

Quantum Physics · Physics 2025-07-11 Otso Kinanen , Andrés D. Muñoz-Moller , Vlad Stirbu , Tommi Mikkonen

In robot-assisted therapy for individuals with Autism Spectrum Disorder, the workload of therapists during a therapeutic session is increased if they have to control the robot manually. To allow therapists to focus on the interaction with…

Robotics · Computer Science 2022-07-26 Michał Stolarz , Alex Mitrevski , Mohammad Wasil , Paul G. Plöger

Mixed-integer quadratic programs (MIQPs) are a versatile way of formulating vehicle decision making and motion planning problems, where the prediction model is a hybrid dynamical system that involves both discrete and continuous decision…

Robotics · Computer Science 2024-05-15 Rudolf Reiter , Rien Quirynen , Moritz Diehl , Stefano Di Cairano

This paper presents a novel Representation-Free Model Predictive Control (RF-MPC) framework for controlling various dynamic motions of a quadrupedal robot in three dimensional (3D) space. Our formulation directly represents the rotational…

Robotics · Computer Science 2021-01-18 Yanran Ding , Abhishek Pandala , Chuanzheng Li , Young-Ha Shin , Hae-Won Park

Dexterous robotic hands enable versatile interactions due to the flexibility and adaptability of multi-fingered designs, allowing for a wide range of task-specific grasp configurations in diverse environments. However, to fully exploit the…

Robotics · Computer Science 2025-08-22 René Zurbrügg , Andrei Cramariuc , Marco Hutter

Quality Diversity (QD) algorithms are a recent family of optimization algorithms that search for a large set of diverse but high-performing solutions. In some specific situations, they can solve multiple tasks at once. For instance, they…

Neural and Evolutionary Computing · Computer Science 2020-04-20 Jean-Baptiste Mouret , Glenn Maguire

Tasks where robots must anticipate human intent, such as navigating around a cluttered home or sorting everyday items, are challenging because they exhibit a wide range of valid actions that lead to similar outcomes. Moreover, zero-shot…

Robotics · Computer Science 2024-04-25 Justin Lidard , Hang Pham , Ariel Bachman , Bryan Boateng , Anirudha Majumdar

In order to safely operate around humans, robots can employ predictive models of human motion. Unfortunately, these models cannot capture the full complexity of human behavior and necessarily introduce simplifying assumptions. As a result,…

As robotic agents increasingly assist humans in reality, quadruped robots offer unique opportunities for interaction in complex scenarios due to their agile movement. However, building agents that can autonomously navigate, adapt, and…

Robotics · Computer Science 2024-12-04 Yuting Mei , Ye Wang , Sipeng Zheng , Qin Jin

As robots are being integrated into our daily lives, it becomes necessary to provide guarantees on the safe and provably correct operation. Such guarantees can be provided using automata theoretic task and mission planning where the…

Systems and Control · Computer Science 2014-11-27 Kangjin Kim , Georgios E. Fainekos , Sriram Sankaranarayanan

We introduce new rounding methods to improve the accuracy of finite precision quantum arithmetic. These quantum rounding methods are applicable when multiple samples are being taken from a quantum program. We show how to use multiple…

Quantum Physics · Physics 2021-08-18 Rajiv Krishnakumar , William Zeng

Recently several hierarchical inverse dynamics controllers based on cascades of quadratic programs have been proposed for application on torque controlled robots. They have important theoretical benefits but have never been implemented on a…

Robotics · Computer Science 2014-11-10 Alexander Herzog , Ludovic Righetti , Felix Grimminger , Peter Pastor , Stefan Schaal

This paper presents an approach for approximating the reachable space of robotic manipulators based on convex polytopes. The proposed approach predicts the reachable space over a given time horizon based on the robot's actuation limits and…

Computational Geometry · Computer Science 2022-12-01 Antun Skuric , Vincent Padois , David Daney

Many computer vision problems can be formulated as binary quadratic programs (BQPs). Two classic relaxation methods are widely used for solving BQPs, namely, spectral methods and semidefinite programming (SDP), each with their own…

Computer Vision and Pattern Recognition · Computer Science 2016-11-18 Peng Wang , Chunhua Shen , Anton van den Hengel
‹ Prev 1 8 9 10 Next ›