نتایج جستجو برای: shortest null space

تعداد نتایج: 557258  

Journal: :Bulletin of the American Mathematical Society 1936

Journal: :IEEE Transactions on Wireless Communications 2022

In this paper, we consider the precoder design for an underloaded or critically loaded downlink multi-user multiple-input multiple-output (MIMO) communication system. We propose novel precoding and decoding schemes which enhance system performance based on rate splitting at transmitter single-stage successive interference cancellation receivers. The proposed null-space (SNS) utilizes linear com...

Journal: :CoRR 2017
Daniel A. Jaume Gonzalo Molina Adrián Pastine Martín Darío Safe

Given a matrix, the Null Space Problem asks for a basis of its null space having the fewest nonzeros. This problem is known to be NP-complete and even hard to approximate. The null space of a forest is the null space of its adjacency matrix. Sander and Sander (2005) and Akbari et al. (2006), independently, proved that the null space of each forest admits a {−1, 0, 1}-basis. We devise an algorit...

Journal: :Robotica 2000
Bojan Nemec Leon Zlajpah

Null space velocity control is essential for achieving good behaviour of a redundant manipulator. Using the dynamically consistent pseudo-inverse, the task and null space motion and forces are decoupled. The paper presents a globally stable null space velocity controller and the gradient projection technique in conjunction with the dynamically consistent pseudo-inverse. The physical meaning and...

2011
Danny Ziyi Chen Haitao Wang

Given a set of h pairwise disjoint polygonal obstacles of totally n vertices in the plane, we study the problem of computing an L1 (or rectilinear) shortest path between two points avoiding the obstacles. Previously, this problem has been solved in O(n log n) time and O(n) space, or alternatively in O(n + h log n) time and O(n + h log h) space. A lower bound of Ω(n + h log h) time and Ω(n) spac...

2002
Frank Schulz Dorothea Wagner Christos D. Zaroliagis

In many fields of application, shortest path finding problems in very large graphs arise. Scenarios where large numbers of on-line queries for shortest paths have to be processed in real-time appear for example in traffic information systems. In such systems, the techniques considered to speed up the shortest path computation are usually based on precomputed information. One approach proposed o...

Journal: :I. J. Robotics Res. 2010
Vincent Duindam Jijie Xu Ron Alterovitz S. Shankar Sastry Kenneth Y. Goldberg

—Steerable needles can be used in medical applications to reach targets behind sensitive or impenetrable areas. The kinematics of a steerable needle are nonholonomic and, in 2D, equivalent to a Dubins car with constant radius of curvature. In 3D, the needle can be interpreted as an airplane with constant speed and pitch rate, zero yaw, and controllable roll angle. We present a constant-time mot...

Journal: :The International journal of robotics research 2008
Vincent Duindam Jijie Xu Ron Alterovitz S. Shankar Sastry Kenneth Y. Goldberg

Steerable needles can be used in medical applications to reach targets behind sensitive or impenetrable areas. The kinematics of a steerable needle are nonholonomic and, in 2D, equivalent to a Dubins car with constant radius of curvature. In 3D, the needle can be interpreted as an airplane with constant speed and pitch rate, zero yaw, and controllable roll angle.We present a constant-time motio...

Journal: :CoRR 2016
Hsiu-Chin Lin Matthew Howard

In recent years, a number of tools have become available that recover the underlying control policy from constrained movements. However, few have explicitly considered learning the constraints of the motion and ways to cope with unknown environment. In this paper, we consider learning the null space projection matrix of a kinematically constrained system in the absence of any prior knowledge ei...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید