Výsledky vyhľadávania - "Sampling-based algorithms"

KDF: Kinodynamic Motion Planning via Geometric Sampling-Based Algorithms and Funnel Control Autor Verginis, Christos K., Dimarogonas, Dimos V., Kavraki, Lydia E.

“… The considered systems evolve subject to complex, nonlinear, and uncertain dynamics (also known as differential constraints…”
Získať plný text

A review of recent trend in motion planning of industrial robots Autor Tamizi, Mehran Ghafarian, Yaghoubi, Marjan, Najjaran, Homayoun

“…Motion planning is an integral part of each robotic system. It is critical to develop an effective motion in order to achieve a successful performance. The…”
Získať plný text

KDF: Kinodynamic Motion Planning via Geometric Sampling-based Algorithms and Funnel Control Autor Verginis, Christos K, Dimarogonas, Dimos V, Kavraki, Lydia E

“… The considered systems evolve subject to complex, nonlinear, and uncertain dynamics (aka differential constraints…”
Získať plný text

A martingale approach and time-consistent sampling-based algorithms for risk management in stochastic optimal control Autor Vu Anh Huynh, Kogan, Leonid, Frazzoli, Emilio

“…In this paper, we consider a class of stochastic optimal control problems with risk constraints that are expressed as bounded probabilities of failure for…”
Získať plný text

A Martingale Approach and Time-Consistent Sampling-based Algorithms for Risk Management in Stochastic Optimal Control Autor Huynh, Vu Anh, Kogan, Leonid, Frazzoli, Emilio

“…In this paper, we consider a class of stochastic optimal control problems with risk constraints that are expressed as bounded probabilities of failure for…”
Získať plný text

Incremental sampling-based algorithm for risk-aware planning under motion uncertainty Autor Wei Liu, Ang, Marcelo H.

“…This paper considers the problem of motion planning for linear systems subject to Gaussian motion noise and proposes a risk-aware planning algorithm: CC-RRT*-D…”
Získať plný text

Voronoi Boundary Visibility for Efficient Path Planning Autor Al-Dahhan, Mohammed Rabeea Hashim, Schmidt, Klaus Werner

“…The subject of this paper is the computation of paths for mobile robots that navigate from a start position to a goal position in environments with static obstacles…”
Získať plný text

Motion Primitive Path Planning for Parametrically Uncertain Systems via the Koopman Operator Autor Gutow, Geordan Mihalick

“…This work considers the application of motion primitives to path planning and obstacle avoidance problems in which the system is subject to significant parametric and/or initial condition uncertainty…”
Získať plný text

A visibility-based pursuit-evasion game between two nonholonomic robots in environments with obstacles Autor Lozano, Eliezer, Becerra, Israel, Ruiz, Ubaldo, Bravo, Luis, Murrieta-Cid, Rafael

“… To determine the players’ motion policies and their trajectories–subject to differential constraints…”
Získať plný text

Semiparametric Bayesian Analysis of Survival Data Autor Sinha, Debajyoti, Dey, Dipak K.

“… Careful applications of some recently popular computational tools, including sampling-based algorithms, are used to find posterior estimates of several quantities of interest even when dealing…”
Získať plný text

Planning and control of multi-robot-object systems under temporal logic tasks and uncertain dynamics Autor Verginis, Christos K., Kantaros, Yiannis, Dimarogonas, Dimos V.

“… The robots and objects evolve subject to uncertain dynamics in an obstacle-cluttered environment…”
Získať plný text

Distributed Motion Coordination for Multirobot Systems Under LTL Specifications Autor Yu, Pian, Dimarogonas, Dimos V.

“… Based on the realistic assumptions that each robot is subject to both state and input constraints and can have only local view and local information, a fully distributed multirobot motion…”
Získať plný text

Modelling recall-based competing risks data with k different models Autor Panwar, M. S., Yadav, C. P.

“…In competing risks model, subjects are exposed to failure due to more than one cause…”
Získať plný text

Models of Approximate Inference in Vision Autor Chattoraj, Ankani

“…To develop a complete understanding of visual perception, it is important to investigate the system at all three levels proposed by Marr: computational goal of…”
Získať plný text

Sampling-based Near Time-Optimal Trajectory Generation for Pneumatic Drives Autor Hoffmann, Kathrin, Baumgart, Michaela, Kanagalingam, Gajanan, Verl, Alexander, Sawodny, Oliver

“… There occur nonlinear state-dependent jerk constraints because the pressure dynamics are not negligibly fast, the air mass flow through the valves is subject to pressure-dependent constraints…”
Získať plný text

First Order Stochastic Optimization with Oblivious Noise Autor Diakonikolas, Ilias, Karmalkar, Sushrut, Park, Jongho, Tzamos, Christos

“… In our setting, in addition to random observation noise, the stochastic gradient may be subject to independent oblivious noise, which may not have bounded moments and is not necessarily centered…”
Získať plný text

Stealthy Terrain-Aware Multi-Agent Active Search Autor Bakshi, Nikhil Angad, Schneider, Jeff

“… We present the Stealthy Terrain-Aware Reconnaissance (STAR) algorithm, a multi-objective parallelized Thompson sampling-based algorithm that relies on a strong…”
Získať plný text

Planning and Control of Multi-Robot-Object Systems under Temporal Logic Tasks and Uncertain Dynamics Autor Verginis, Christos K, Kantaros, Yiannis, Dimarogonas, Dimos V

“… The robots and objects evolve subject to uncertain dynamics in an obstacle-cluttered environment…”
Získať plný text

Distributed motion coordination for multi-robot systems under LTL specifications Autor Pian Yu, Dimarogonas, Dimos V

“… Based on the realistic assumptions that each robot is subject to both state and input constraints and can have only local view and local information, a fully distributed multi-robot motion…”
Získať plný text

Stochastic Matching with Few Queries: \((1-\varepsilon)\) Approximation Autor Behnezhad, Soheil, Derakhshan, Mahsa, Hajiaghayi, MohammadTaghi

“…\). The maximum degree of \(Q\) can depend on \(p\), but not on the size of \(G\). This problem has been subject to extensive studies over the years and the approximation…”
Získať plný text