Results 251 to 260 of about 208,662 (295)
Some of the next articles are maybe not open access.

Path Smoothing with Deterministic Shortcuts

2022 Sixth IEEE International Conference on Robotic Computing (IRC), 2022
Maryam Khazaei Pool   +2 more
exaly   +2 more sources

Clear and smooth path planning

Applied Soft Computing, 2015
In this paper we discuss on multi-objective robot path planning in continuous space with static obstacles. We focus on the point-to-point paths with three goals minimizing path length, maximizing clearance and maximizing smoothness. We propose an efficient evolutionary algorithm to solve this problem.
Mansoor Davoodi Monfared   +3 more
openaire   +1 more source

Smooth path planning for cars

Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164), 2002
Addresses continuous-curvature path planning for cars. It presents an improved version of a previous steering method (i.e. an algorithm computing paths in the absence of obstacles) for cars and the embedding of this steering method in a global path planning scheme.
Thierry Fraichard, Juan Manuel Ahuactzin
openaire   +1 more source

Smooth Path Planning for Continuum Arms

2021 IEEE International Conference on Robotics and Automation (ICRA), 2021
Continuum arms, with their mix of compliance, payload, safety, and manipulability, are perfectly suited to serve as co-robots, and their applications range from industry and manufacturing to human healthcare. Their hyper-redundancy serves as their most significant challenge for path planning and path planning approaches commonly used with rigid-link ...
Brandon H. Meng   +2 more
openaire   +1 more source

Planning smooth paths for mobile robots

Proceedings, 1989 International Conference on Robotics and Automation, 1993
The authors consider the problem of planning paths for a robot which has a minimum turning radius. This is a first step towards accurately modeling a robot with the kinematics of a car. The technique used is to define a set of canonical trajectories which satisfy the nonholonomic constraints imposed.
Paul E. Jacobs, John F. Canny
openaire   +1 more source

On the smoothness of optimal paths

Decisions in Economics and Finance, 2004
The authors have proven the \(C^r\) differentiability of optimal path with respect to different parameters under conditions that ensure the invertibility of the operator associated to the Euler-Lagrange equation. These parameters are the initial vector of capital stock, the discount rate and a parameter which lies in a Banach space.
Blot, Joël, Crettez, Bertrand
openaire   +1 more source

Path smoothing via discrete optimization

Proceedings of the 45th annual Design Automation Conference, 2008
A fundamental problem in timing-driven physical synthesis is the reduction of critical paths in a design. In this work, we propose a powerful new technique that moves (and can also resize) multiple cells simultaneously to smooth critical paths, thereby reducing delay and improving worst negative slack or a figure-of-merit.
Michael D. Moffitt   +3 more
openaire   +1 more source

Smoothing the path to transition

2015
This report is the key project output from a two-year, $200,000 TLRI-funded PAR research project centred on exploring the perceived academic literacy gap in the transition from secondary to tertiary learning contexts. The research adopted an academic literacy pedagogy to connect writing and critical thinking with disciplinary knowledge development ...
Emerson L, Kilpin K, Feekery AJ
openaire   +1 more source

Smoothing the path of integration

Industrial and Commercial Training, 2010
PurposeThis paper aims to underline the importance of the training and communications process in implementing business integration solutions, securing employee commitment and building a customer‐centric culture. Also, to demonstrate how the benefits of a systematic based approach can help organizations by improving customer service skills and building ...
openaire   +1 more source

A quadratic programming approach to path smoothing

Proceedings of the 2011 American Control Conference, 2011
This paper presents a method for smoothing a path in an environment with obstacles. Some characteristic nodes of the path are updated in each iteration by solving a quadratic program, which is formulated based on the smoothness constraints and the local environment information. The generated path satisfies the prescribed smoothness constraints, such as
Yiming Zhao, Panagiotis Tsiotras
openaire   +1 more source

Home - About - Disclaimer - Privacy