Reactive navigation for non-holonomic robots using the ego-kinematic space

2003 ◽  
Author(s):  
J. Minguez ◽  
L. Montano ◽  
J. Santos-Victor
Keyword(s):  
Reactive Navigation ◽  
Kinematic Space

scholarly journals Does SUSY have friends? A new approach for LHC event analysis

2021 ◽  
Vol 2021 (2) ◽  
Author(s):  
Anna Mullin ◽  
Stuart Nicholls ◽  
Holly Pacey ◽  
Michael Parker ◽  
Martin White ◽  
...  
Keyword(s):  
Hadron Collider ◽  
Local Network ◽  
Proton Collision ◽  
Event Analysis ◽  
Final State ◽  
Proton Proton ◽  
Kinematic Space ◽  
Boosted Decision Tree ◽  
The Individual ◽  
Particle Search

Abstract We present a novel technique for the analysis of proton-proton collision events from the ATLAS and CMS experiments at the Large Hadron Collider. For a given final state and choice of kinematic variables, we build a graph network in which the individual events appear as weighted nodes, with edges between events defined by their distance in kinematic space. We then show that it is possible to calculate local metrics of the network that serve as event-by-event variables for separating signal and background processes, and we evaluate these for a number of different networks that are derived from different distance metrics. Using a supersymmetric electroweakino and stop production as examples, we construct prototype analyses that take account of the fact that the number of simulated Monte Carlo events used in an LHC analysis may differ from the number of events expected in the LHC dataset, allowing an accurate background estimate for a particle search at the LHC to be derived. For the electroweakino example, we show that the use of network variables outperforms both cut-and-count analyses that use the original variables and a boosted decision tree trained on the original variables. The stop example, deliberately chosen to be difficult to exclude due its kinematic similarity with the top background, demonstrates that network variables are not automatically sensitive to BSM physics. Nevertheless, we identify local network metrics that show promise if their robustness under certain assumptions of node-weighted networks can be confirmed.

scholarly journals Spacetime as a quantum circuit

2021 ◽  
Vol 2021 (4) ◽  
Author(s):  
A. Ramesh Chandra ◽  
Jan de Boer ◽  
Mario Flory ◽  
Michal P. Heller ◽  
Sergio Hörtner ◽  
...  
Keyword(s):  
Path Integral ◽  
Constant Scalar Curvature ◽  
Quantum Circuit ◽  
Quantum Circuits ◽  
Special Role ◽  
Gravitational Action ◽  
Volume Conjecture ◽  
Interesting Connection ◽  
Kinematic Space ◽  
Boundary States

Abstract We propose that finite cutoff regions of holographic spacetimes represent quantum circuits that map between boundary states at different times and Wilsonian cutoffs, and that the complexity of those quantum circuits is given by the gravitational action. The optimal circuit minimizes the gravitational action. This is a generalization of both the “complexity equals volume” conjecture to unoptimized circuits, and path integral optimization to finite cutoffs. Using tools from holographic $$ T\overline{T} $$ T T ¯ , we find that surfaces of constant scalar curvature play a special role in optimizing quantum circuits. We also find an interesting connection of our proposal to kinematic space, and discuss possible circuit representations and gate counting interpretations of the gravitational action.

Reactive navigation of wheeled robots for border patrolling

2016 ◽  
pp. 63-111
Author(s):  
Alexey S. Matveev ◽  
Andrey V. Savkin ◽  
Michael Hoy ◽  
Chao Wang
Keyword(s):  
Reactive Navigation ◽  
Wheeled Robots

Reactive navigation among moving and deforming obstacles

2016 ◽  
pp. 185-227
Author(s):  
Alexey S. Matveev ◽  
Andrey V. Savkin ◽  
Michael Hoy ◽  
Chao Wang
Keyword(s):  
Reactive Navigation

Gröbner basis and resultant method for the forward displacement of 3-DoF planar parallel manipulators in seven-dimensional kinematic space

Robotica ◽  
2015 ◽  
Vol 34 (11) ◽  
pp. 2610-2628 ◽  
Author(s):  
Davood Naderi ◽  
Mehdi Tale-Masouleh ◽  
Payam Varshovi-Jaghargh
Keyword(s):  
Euclidean Space ◽  
Gröbner Basis ◽  
Three Dimensional ◽  
Parallel Manipulators ◽  
Parallel Robots ◽  
Dimensional Euclidean Space ◽  
Grobner Basis ◽  
Kinematic Space ◽  
Forward Kinematic Problem ◽  
Forward Kinematic

SUMMARYIn this paper, the forward kinematic analysis of 3-degree-of-freedom planar parallel robots with identical limb structures is presented. The proposed algorithm is based on Study's kinematic mapping (E. Study, “von den Bewegungen und Umlegungen,” Math. Ann.39, 441–565 (1891)), resultant method, and the Gröbner basis in seven-dimensional kinematic space. The obtained solution in seven-dimensional kinematic space of the forward kinematic problem is mapped into three-dimensional Euclidean space. An alternative solution of the forward kinematic problem is obtained using resultant method in three-dimensional Euclidean space, and the result is compared with the obtained mapping result from seven-dimensional kinematic space. Both approaches lead to the same maximum number of solutions: 2, 6, 6, 6, 2, 2, 2, 6, 2, and 2 for the forward kinematic problem of planar parallel robots; 3-RPR, 3-RPR, 3-RRR, 3-RRR, 3-RRP, 3-RPP, 3-RPP, 3-PRR, 3-PRR, and 3-PRP, respectively.

Sign in / Sign up

Export Citation Format

Share Document