Results 91 to 100 of about 2,188,345 (345)
The Subset Sum Problem: Reducing Time Complexity of NP-Completeness with Quantum Search
The Subset Sum Problem is a member of the NP-complete class, so no known polynomial time algorithm exists for it. Although there are polynomial time approximations and heuristics, these are not always acceptable, yet exact-solution algorithms are ...
Bo Moon
doaj +1 more source
Hard‐Magnetic Soft Millirobots in Underactuated Systems
This review provides a comprehensive overview of hard‐magnetic soft millirobots in underactuated systems. It examines key advances in structural design, physics‐informed modeling, and control strategies, while highlighting the interplay among these domains.
Qiong Wang +4 more
wiley +1 more source
Robot Time-Optimal Trajectory Planning Based on Improved Cuckoo Search Algorithm
The trajectory planning time is uncertain when there is no velocity constraint in the joint space of an operating robot. This paper proposes a 3-5-3 polynomial interpolation trajectory planning algorithm based on improved cuckoo search algorithm (ICS ...
Wenjie Wang +4 more
doaj +1 more source
A Polynomial-time Algorithm for the Bistable Roommates Problem
In a recent paper, \textit{B. P. Weems} [J. Comput. Syst. Sci. 59, No. 3, 504--520 (1999; Zbl 0946.90073)] introduced the bistable matching problem, and asked if a polynomial-time algorithm exists to decide the feasibility of the bistable roommates problem. We resolve this question in the affirmative using linear programming.
Jay Sethuraman, Chung-Piaw Teo
openaire +1 more source
A verified factorization algorithm for integer polynomials with polynomial complexity [PDF]
Short vectors in lattices and factors of integer polynomials are related. Each factor of an integer polynomial belongs to a certain lattice. When factoring polynomials, the condition that we are looking for an irreducible polynomial means that we must ...
Yamada, Akihisa +7 more
core
Embedded flexible sensing technologies advance underwater soft robotics, yet most systems still suffer from hysteresis and limited perceptiveness. Instead, vision‐based tactile sensors provide reliable and rapid feedback essential for complex underwater tasks.
Qiyi Zhang +5 more
wiley +1 more source
Parametric Polynomial Time Perceptron Rescaling Algorithm
Let us consider a linear feasibility problem with a possibly infinite number of inequality constraints posed in an on-line setting: an algorithm suggests a candidate solution, and the oracle either confirms its feasibility, or outputs a violated ...
Kharechko, Andriy
core
Pak Biawak, a necrobot, embodies an unusual fusion of biology and robotics. Designed to repurpose natural structures after death, it challenges conventional boundaries between nature and engineering. Its movements are precise yet unsettling, raising questions about sustainability, ethics, and the untapped potential of biointegrated machines.
Leo Foulds +2 more
wiley +1 more source
This work presents a state‐adaptive Koopman linear quadratic regulator framework for real‐time manipulation of a deformable swab tool in robotic environmental sampling. By combining Koopman linearization, tactile sensing, and centroid‐based force regulation, the system maintains stable contact forces and high coverage across flat and inclined surfaces.
Siavash Mahmoudi +2 more
wiley +1 more source
Compliant Pneumatic Feet with Real‐Time Stiffness Adaptation for Humanoid Locomotion
A compliant pneumatic foot with real‐time variable stiffness enables humanoid robots to adapt to changing terrains. Using onboard vision and pressure control, the foot modulates stiffness within each gait cycle, reducing impact forces and improving balance. The design, cast in soft silicone with embedded air chambers and Kevlar wrapping, offers durable,
Irene Frizza +3 more
wiley +1 more source

