Abstract: The time-optimal trajectory planning problem involves minimizing the time required to follow a path defined in space, subject to kinematic and dynamic constraints. Here, we introduce a novel ...

Abstract: This paper derives a bisection algorithm for computing the frequency response gain of sampled-data systems with their intersample behavior taken into account. The properties of the ...

The probabilistic bisection algorithm (PBA) solves a class of stochastic rootfinding problems in one dimension by successively updating a prior belief on the location of the root based on noisy ...

We present a novel exact algorithm for the minimum graph bisection problem, whose goal is to partition a graph into two equally-sized cells while minimizing the number of edges between them. Our ...

With the rapid development of quantum computers, researchers have shown quantum advantages in physics-oriented problems. Quantum algorithms tackling computational biology problems are still lacking.