# Browsing by Subject "Path planning"

Now showing 1 - 5 of 5

- Results Per Page
1 5 10 20 40 60 80 100

- Sort Options
Ascending Descending

Item Automated estimation of time and cost for determining optimal machining plans(2012-05) Van Blarigan, Benjamin; Campbell, Matthew I.; Li, WeiShow more The process of taking a solid model and producing a machined part requires the time and skillset of a range of professionals, and several hours of part review, process planning, and production. Much of this time is spent creating a methodical step-by-step process plan for creating the part from stock. The work presented here is part of a software package that performs automated process planning for a solid model. This software is capable of not only greatly decreasing the planning time for part production, but also give valuable feedback about the part to the designer, as a time and cost associated with manufacturing the part. In order to generate these parameters, we must simulate all aspects of creating the part. Presented here are models that replicate these aspects. For milling, an automatic tool selection method is presented. Given this tooling, another model uses specific information about the part to generate a tool path length. A machining simulation model calculates relevant parameters, and estimates a time for machining given the tool and tool path determined previously. This time value, along with the machining parameters, is used to estimate the wear to the tooling used in the process. Using the machining time and the tool wear a cost for the process can be determined. Other models capture the time of non-machining production times, and all times are combined with billing rates of machines and operators to present an overall cost for machining a feature on a part. If several such features are required to create the part, these models are applied to each feature, until a complete process plan has been created. Further post processing of the process plan is required. Using a list of available machines, this work considers creating the part on all machines, or any combination of these machines. Candidates for creating the part on specific machines are generated and filtered based on time and cost to keep only the best candidates. These candidates can be returned to the user, who can evaluate, and choose, one candidate. Results are presented for several example parts.Show more Item Box pushing with a mobile robot using visual servoing(2019-05-09) Ainampudi, Parthasarathi; Longoria, Raul G.Show more Pushing is one of the many ways to manipulate an object and it is especially useful when the object is too big to be gripped by the robot. Previous studies analyzed the problem of pushing polygonal objects into desired poses and proposed open loop pushing algorithms. In the absence of object pose feedback, to avoid slip in contact between the robot and the object, primitives for path planning were computed using conservative estimates for coefficient of friction between the robot and the object. In this work, we experimentally measured the coefficient of friction between the robot and object to compute path planning primitives. We used A* search and RRT* algorithms for path planning. We perform controlled pushing using object pose feedback obtained from a vision system using fiduciary markers. Pushing objects with object pose feedback enables us to confidently operate close to the frictional limits of the system, as the robot can take paths with tighter turns (smaller turning radius) to push the object into the goal pose.Show more Item Computationally efficient path planning algorithm for autonomous navigation over natural terrain(2011-08) Guerrero De La Pena, Ana Isabel; Marchand, Belinda G.; Fowler, WallaceShow more The present investigation focuses on the development of computationally efficient path planning algorithms for autonomous ground vehicles. The approach selected is based on a heuristic hill climbing local search. The cost index employed incorporates a traversability cost average, which offers two primary benefits: 1) the average extends the region of knowledge of the search algorithm, increasing optimality of the solution; and 2) the avoidance of hazardous regions is added to the decision making process. A binary traversability map representation is first utilized to analyze the performance of the enhanced heuristic hill climbing algorithm in comparison to the more traditional techniques. Next, the search algorithm is applied to a multi-valued traversability map to test the capabilities of the algorithm over natural terrain. For this purpose, a digital elevation map is automatically processed to obtain multi-valued traversability values through the de nition of a roughness, inclination and step index. The complete path planning architecture for natural terrain then consists of a three step approach, computation of the multi-valued traversability map, implementation of the enhanced heuristic hill climbing search algorithm, and a path relaxation step. This last step is employed to fine-tune and smooth the trajectory, eliminating sharp turns caused by the regular characteristics of the search space.Show more Item Multi-agent distributed coverage control and multi-target tracking in complex and dynamic environments(2022-05-06) Abdulghafoor, Alaa Zaki Abdulrahman; Bakolas, Efstathios; Chen, Dongmei "Maggie"; Sentis, Luis; Zanetti, Renato; Tanaka, TakashiShow more In this work, we study and investigate problems associated with decentralized/distributed area coverage control and deployment of multi-agent networks as well as density estimation, path planning and motion coordination of the latter networks for multi-target tracking in dynamic and complex environments. In particular, we consider deployment (which includes target tracking applications) and area coverage problems in which the members of the multi-agent network have to deploy and allocate themselves over a given domain in accordance with a time-varying Gaussian mixture reference density function (demand function for the network) in complex and non-complex environments (domains with or without obstacles (which can be either static or dynamic)). The latter density function can either represent the reference coverage density or the reference tracking density according to the application considered in each scenario. Hence, different scenarios of the latter problems are investigated in which the proposed problem is comprised of two sub-problems which are coupled and interconnected with each other. The first problem (high-level/macroscopic problem) corresponds to a density path planning and / or density estimation (implemented in a centralized manner) whereas the second problem (low-level/microscopic problem) to a decentralized and distributed control and motion coordination problem. Our proposed approach is based on a combination of the macroscopic and microscopic descriptions of the multi-agent network. The macroscopic description of the network corresponds to the probability distribution of the agents' locations over a given region. In this description, the multi-agent network is treated as one unit (characterized by the networks PDF). The microscopic description of the network corresponds to the collection of all individual positions of the network's agents. The objective of our work is to find control algorithms that will allow a multi-agent network to attain a spatial distribution that matches the reference density function (macroscopic high-level problem) through the local interactions of the agents at the individual level (microscopic low-level distributed control problem). The high-level problem is associated with an interpolation problem in the class of Gaussian Mixtures (GMs) which seeks to find a density path that connects two boundary GMs. Moreover, the low-level control problem is addressed by utilizing the Lloyd's algorithm together with Voronoi tessellations and a time-varying GM reference density function which corresponds to the solution of the high-level problem. Because the high-level and the low-level problems of all the considered scenarios are inherently coupled to each other (interconnected in the sense that in order to solve the second problem we require the solution of the first problem), we propose an iterative scheme that combines the solutions of the first and the second problems in order to solve and address the path planning/density estimation, motion coordination, deployment and area coverage control problems of multi-agent networks in dynamic and complex environments in a successful, complete, safe and holistic way. In the first scenario (Scenario 1 presented in Chapter 2), the goal of the multi-agent network is to track the time-varying GM reference coverage density function that reshapes the agents' distribution from an initial single Gaussian probability distribution to a Gaussian mixture distribution in a domain with no obstacles (non-complex environment). In the second scenario (Scenario 2 presented in Chapter 3) the aim is to transfer the distribution of the agents from an initial GM to a final desired GM over a cluttered complex domain populated by static obstacles that the agents must not collide with while at all times as they are moving and trying to track the time-varying GM reference coverage density. In Scenarios 1 and 2, the high-level problem (first problem) was solved analytically by providing a closed form solution. The low-level control problem (second problem) corresponds to a decentralized and distributed control problem (collision avoidance requirement is now enforced at all times) which is solved by utilizing Lloyd's algorithm together with Voronoi tessellations and a time-varying GM reference coverage density function which corresponds to the centralized solution of the high-level coverage control problem (first problem). For Scenario 2, our approach utilizes a modified version of Voronoi tessellations which are comprised of what we refer to as Obstacle-Aware Voronoi Cells (OAVC) in order to enable coverage control while ensuring obstacle avoidance. In contrast with the first two scenarios (Scenarios 1 and 2), the next scenarios to be discussed (Scenarios 3 and 4) the time-varying GM reference densities are not known a priori and will correspond to the reference tracking density of a multi-target system which is characterized as a GM tracking density utilized to steer the agents to follow the targets; thus, in the first problems of the latter scenarios, state-of the-art estimation techniques will be employed to obtain their solutions. In the third scenario (Scenario 3 presented in Chapter 4) we address a multi-target tracking problem for a multi-agent network. Thus, we consider a density estimation, path planning and distributed/decentralized motion coordination problem for a multi-agent network whose members have to track multiple moving targets over a cluttered complex environment with static obstacles. In the first problem, which corresponds to a density estimation and path planning problem, the goal is to obtain a GM reference tracking density path of the multi-target network that the multi-agent system must track as a whole. In the proposed solution approach of the latter problem, the probability density of the multi-target system is characterized by a Gaussian mixture distribution density which is estimated by an adaptive Gaussian sum filter (AGSF) in order incorporate the complete evolution of the targets' PDFs between two measurements during the estimation. Therefore, the weights (mixing proportions) of the Gaussian components/ mixands (which correspond to the individual target's PDF) update continuously at every time step during the propagation of the state PDFs between two measurements by solving a convex optimization problem which requires the GM approximation to satisfy the so called Fokker-Planck-Kolmogorov equation (FPKE) for continuous time dynamical systems. In the second problem, which corresponds to a distributed and decentralized motion coordination problem, we seeks to find the individual control inputs that steer the agents to follow and track the mobile targets (by tracking the GM reference tacking density estimated solution of the first problem) while avoiding collisions at all times. Hence the same solution approach utilized for Scenario 2 will be employed to solve the second problem of Scenario 3. In the Fourth scenario (Scenario 4 presented in Chapter 5) we address an optimal path planning, density estimation and motion coordination problem for a very-large-scale multi-agent network whose members are aimed to track a very-large-scale system of mobile targets that maneuver while avoiding dynamic moving obstacles in an uncertain changing environment. The goal of the multi-agent network is to follow the targets by tracking their optimal reference estimated probability density which is represented as a GM distribution while avoiding collision with all the dynamic obstacles over the uncertain region. The estimated reference density is optimal in the sense that it represents the GM density of the targets as they seek the shortest path to reach their final destinations in the shortest time while avoiding the dynamic obstacles in the uncertain domain. The first problem corresponds to the optimal path planning and density estimation of the VLST system in the uncertain dynamic environment while the second problem is the motion coordination problem of the very-large-scale multi-agent network. Therefore, the solution approach to tackle the first problem depends on the utilization of an adaptive distributed optimal control (ADOC) framework which is in turn based on tools and concepts from optimal mass transport theory as well as reinforcement learning and approximate dynamic programming (and optimization) in the Wasserstein-GMM space where the value functional is defined in terms of the PDF (corresponds to a GM density) of the targets and the time-varying obstacle map function which describes the dynamic uncertain environment. The key challenge in the latter approach, is estimating and the continuously updating the PDF of the VLST system in accordance with the real time/"online" approximation of the time-varying obstacle map which describe the dynamic obstacles and the uncertain changing environmental information which affect the estimation of latter PDF. The second problem of Scenario 4 will be addressed similarly to that of Scenarios 2 and 3.Show more Item A preliminary study on path planning and obstacle avoidance for construction equipment based on real-time spatial models(2005-12-24) Chi, Seok Ho; Caldas, Carlos H.Show more On obstacle-cluttered construction sites where heavy equipment is in use, safety and productivity issues are major concerns. Efficient and effective algorithms for obstacle avoidance and path planning, based on real-time three dimensional spatial modeling, have the potential not only to obviate collisions between heavy equipment and other on-site objects, but also to allow autonomous heavy equipment to move to target positions quickly without any accidents. Therefore, algorithms for obstacle avoidance and path planning can play a key role in addressing safety and productivity issues. This research constitutes a preliminary study of a path planning method. Several algorithms for image data acquisition, real-time 3D spatial modeling, and shortest path finding were adapted and developed. These algorithms were integrated to construct an entire, comprehensive collision-free path. Once the path planning algorithm was developed, computer simulation was conducted to verify its accuracy. The algorithm worked well in a proposed simulation environment cluttered with a static object and a moving object. The occupancy grid algorithm successfully built a suitable 3D local model in real-time, and the path finding algorithm was able to produce a collision-free motion trajectory. This research result shows that the proposed path planning approach is potentially feasible for contributing to improved safety and productivity, and to future applications for autonomous heavy equipment operation in constructionShow more