Results 261 to 270 of about 142,983 (313)
Advanced Materials, EarlyView.Layer orientation dictates charge transport in 2D conjugated metal–organic frameworks, yet controllable methods remain scarce. We report surfactant monolayer‐assisted on‐water synthesis of cm2‐scale Ni‐HHTP films with programmable face‐on and edge‐on orientations.
Jianjun Zhang +22 more
wiley +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88, 1988
We consider the motion planning problem for a point constrained to move along a path with radius of curvature at least one. The point moves in a two-dimensional universe with polygonal obstacles. We show the decidability of the reachability question: “Given a source placement (position and direction pair) and a target placement, is there a curvature ...
Steven Fortune, Gordon T. Wilfong
openaire +2 more sources
We consider the motion planning problem for a point constrained to move along a path with radius of curvature at least one. The point moves in a two-dimensional universe with polygonal obstacles. We show the decidability of the reachability question: “Given a source placement (position and direction pair) and a target placement, is there a curvature ...
Steven Fortune, Gordon T. Wilfong
openaire +2 more sources
Motion planning with uncertainty
Proceedings. 1998 IEEE International Conference on Robotics and Automation (Cat. No.98CH36146), 2002We present a general framework for motion planning of robots in the presence of obstacles and other robots. We use variational calculus and optimization to find optimal open loop and closed loop plans in the presence of uncertainty. The plans are based on world models with set-valued uncertainty associated with the positions and shape of the obstacles.
Hong Zhang 0015 +2 more
openaire +1 more source
Journal of the ACM, 1993
Summary: Kinodynamic planning attempts to solve a robot motion problem subject to simultaneous kinematic and dynamics constraints. In the general problem, given a robot system, we must find a minimal-time trajectory that goes from a start position and velocity to a goal position and velocity while avoiding obstacles by a safety margin and respecting ...
Bruce Randall Donald +3 more
openaire +1 more source
Summary: Kinodynamic planning attempts to solve a robot motion problem subject to simultaneous kinematic and dynamics constraints. In the general problem, given a robot system, we must find a minimal-time trajectory that goes from a start position and velocity to a goal position and velocity while avoiding obstacles by a safety margin and respecting ...
Bruce Randall Donald +3 more
openaire +1 more source
Proceedings 1997 IEEE International Symposium on Computational Intelligence in Robotics and Automation CIRA'97. 'Towards New Computational Principles for Robotics and Automation', 2002
Multiscale planning is introduced as a nested system of state space search processes which provide for exceptionally efficient computational algorithms. It is demonstrated that search in the output space allows for efficient planning/control procedures. The results of 2-level nested hierarchical planning are given as a representative simulation example.
James S. Albus +2 more
openaire +1 more source
Multiscale planning is introduced as a nested system of state space search processes which provide for exceptionally efficient computational algorithms. It is demonstrated that search in the output space allows for efficient planning/control procedures. The results of 2-level nested hierarchical planning are given as a representative simulation example.
James S. Albus +2 more
openaire +1 more source
IEEE Robotics and Automation Letters, 2018
While predictive planning approaches have had broad success in robot navigation, most implementations of them have important limitations. In particular, they plan around a single predicted outcome (plus uncertainty) or the union of several likely outcomes. Here, we introduce the multiworld motion planning problem, where a robot plans around each likely
Bobby Davis +2 more
openaire +1 more source
While predictive planning approaches have had broad success in robot navigation, most implementations of them have important limitations. In particular, they plan around a single predicted outcome (plus uncertainty) or the union of several likely outcomes. Here, we introduce the multiworld motion planning problem, where a robot plans around each likely
Bobby Davis +2 more
openaire +1 more source
Motion planning for the Snakeboard
The International Journal of Robotics Research, 2012This paper provides an analytical solution to the motion-planning problem for the Snakeboard. Given a desired planar trajectory in the fiber space, an explicit solution is computed for the controllable inputs in the base space that locomote the Snakeboard along a given trajectory. The motion-planning problem or gait generation problem is solved for the
Elie A. Shammas +1 more
openaire +1 more source
SMC'03 Conference Proceedings. 2003 IEEE International Conference on Systems, Man and Cybernetics. Conference Theme - System Security and Assurance (Cat. No.03CH37483), 2004
This paper addresses the problem of kinodynamic motion planning for a non-holonomic bicycle system moving on a 2D plane in minimum time. As a solution to this optimization problem, we propose an algorithm for determining feed-forward control values, which in the absence of disturbances and uncertainties, provide a plan to move a system from an initial ...
Alessandro Rosiglioni, Marin Simina
openaire +1 more source
This paper addresses the problem of kinodynamic motion planning for a non-holonomic bicycle system moving on a 2D plane in minimum time. As a solution to this optimization problem, we propose an algorithm for determining feed-forward control values, which in the absence of disturbances and uncertainties, provide a plan to move a system from an initial ...
Alessandro Rosiglioni, Marin Simina
openaire +1 more source
2019 American Control Conference (ACC), 2019
In this paper, we introduce the problem of motion planning with secrecy guarantees. A robot is tracking a desired trajectory, which is transmitted on-line by a planner, e.g. a base station or a mobile station. The communication between the robot and the planner is organized in packets and takes place over a wireless channel, which is susceptible to ...
Anastasios Tsiamis +2 more
openaire +1 more source
In this paper, we introduce the problem of motion planning with secrecy guarantees. A robot is tracking a desired trajectory, which is transmitted on-line by a planner, e.g. a base station or a mobile station. The communication between the robot and the planner is organized in packets and takes place over a wireless channel, which is susceptible to ...
Anastasios Tsiamis +2 more
openaire +1 more source