CINXE.COM

<!DOCTYPE html> <html lang="en" dir="ltr"> <head>  <script async src="https://www.googletagmanager.com/gtag/js?id=G-P63WKM1TM1"></script> <script> window.dataLayer = window.dataLayer || []; function gtag(){dataLayer.push(arguments);} gtag('js', new Date()); gtag('config', 'G-P63WKM1TM1'); </script>  <script type="text/javascript" > (function(m,e,t,r,i,k,a){m[i]=m[i]||function(){(m[i].a=m[i].a||[]).push(arguments)}; m[i].l=1*new Date(); for (var j = 0; j < document.scripts.length; j++) {if (document.scripts[j].src === r) { return; }} k=e.createElement(t),a=e.getElementsByTagName(t)[0],k.async=1,k.src=r,a.parentNode.insertBefore(k,a)}) (window, document, "script", "https://mc.yandex.ru/metrika/tag.js", "ym"); ym(55165297, "init", { clickmap:false, trackLinks:true, accurateTrackBounce:true, webvisor:false }); </script> <noscript><div><img src="https://mc.yandex.ru/watch/55165297" style="position:absolute; left:-9999px;" alt="" /></div></noscript>    <title>Search results for: optimal path motion</title> <meta name="description" content="Search results for: optimal path motion"> <meta name="keywords" content="optimal path motion"> <meta name="viewport" content="width=device-width, initial-scale=1, minimum-scale=1, maximum-scale=1, user-scalable=no"> <meta charset="utf-8"> <link href="https://cdn.waset.org/favicon.ico" type="image/x-icon" rel="shortcut icon"> <link href="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/css/bootstrap.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/plugins/fontawesome/css/all.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/css/site.css?v=150220211555" rel="stylesheet"> </head> <body> <header> <div class="container"> <nav class="navbar navbar-expand-lg navbar-light"> <a class="navbar-brand" href="https://waset.org"> <img src="https://cdn.waset.org/static/images/wasetc.png" alt="Open Science Research Excellence" title="Open Science Research Excellence" /> </a> <button class="d-block d-lg-none navbar-toggler ml-auto" type="button" data-toggle="collapse" data-target="#navbarMenu" aria-controls="navbarMenu" aria-expanded="false" aria-label="Toggle navigation"> <span class="navbar-toggler-icon"></span> </button> <div class="w-100"> <div class="d-none d-lg-flex flex-row-reverse"> <form method="get" action="https://waset.org/search" class="form-inline my-2 my-lg-0"> <input class="form-control mr-sm-2" type="search" placeholder="Search Conferences" value="optimal path motion" name="q" aria-label="Search"> <button class="btn btn-light my-2 my-sm-0" type="submit"><i class="fas fa-search"></i></button> </form> </div> <div class="collapse navbar-collapse mt-1" id="navbarMenu"> <ul class="navbar-nav ml-auto align-items-center" id="mainNavMenu"> <li class="nav-item"> <a class="nav-link" href="https://waset.org/conferences" title="Conferences in 2024/2025/2026">Conferences</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/disciplines" title="Disciplines">Disciplines</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/committees" rel="nofollow">Committees</a> </li> <li class="nav-item dropdown"> <a class="nav-link dropdown-toggle" href="#" id="navbarDropdownPublications" role="button" data-toggle="dropdown" aria-haspopup="true" aria-expanded="false"> Publications </a> <div class="dropdown-menu" aria-labelledby="navbarDropdownPublications"> <a class="dropdown-item" href="https://publications.waset.org/abstracts">Abstracts</a> <a class="dropdown-item" href="https://publications.waset.org">Periodicals</a> <a class="dropdown-item" href="https://publications.waset.org/archive">Archive</a> </div> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/page/support" title="Support">Support</a> </li> </ul> </div> </div> </nav> </div> </header> <main> <div class="container mt-4"> <div class="row"> <div class="col-md-9 mx-auto"> <form method="get" action="https://publications.waset.org/abstracts/search"> <div id="custom-search-input"> <div class="input-group"> <i class="fas fa-search"></i> <input type="text" class="search-query" name="q" placeholder="Author, Title, Abstract, Keywords" value="optimal path motion"> <input type="submit" class="btn_search" value="Search"> </div> </div> </form> </div> </div> <div class="row mt-3"> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Commenced</strong> in January 2007</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Frequency:</strong> Monthly</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Edition:</strong> International</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Paper Count:</strong> 5433</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: optimal path motion</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5433</span> Optimal Path Motion of Positional Electric Drive</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20A.%20Grigoryev">M. A. Grigoryev</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20N.%20Shishkov"> A. N. Shishkov</a>, <a href="https://publications.waset.org/abstracts/search?q=N.%20V.%20Savosteenko"> N. V. Savosteenko</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The article identifies optimal path motion of positional electric drive, for example, the feed of cold pilgering mill. It is shown that triangle is the optimum shape of the speed curve, and the ratio of its sides depends on the type of load diagram, in particular from the influence of the main drive of pilgering mill, and is not dependent on the presence of backlash and elasticity in the system. This thesis is proved analytically, and confirmed the results are obtained by a mathematical model that take into account the influence of the main drive-to-drive feed. By statistical analysis of oscillograph traces obtained on the real object allowed to give recommendations on the optimal control of the electric drive feed cold pilgering mill 450. Based on the data that the load torque depends on by hit the pipe in rolls of pilgering mill, occurs in the interval (0,6…0,75) tc, the recommended ratio of start time to the braking time is 2:1. Optimized path motion allowed get up to 25% more RMS torque for the cycle that allowed increased the productivity of the mill. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=optimal%20curve%20speed" title="optimal curve speed">optimal curve speed</a>, <a href="https://publications.waset.org/abstracts/search?q=positional%20electric%20drive" title=" positional electric drive"> positional electric drive</a>, <a href="https://publications.waset.org/abstracts/search?q=cold%20pilgering%20mill%20450" title=" cold pilgering mill 450"> cold pilgering mill 450</a>, <a href="https://publications.waset.org/abstracts/search?q=optimal%20path%20motion" title=" optimal path motion"> optimal path motion</a> </p> <a href="https://publications.waset.org/abstracts/46141/optimal-path-motion-of-positional-electric-drive" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/46141.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">317</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5432</span> Three-Dimensional Optimal Path Planning of a Flying Robot for Terrain Following/Terrain Avoidance</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Amirreza%20Kosari">Amirreza Kosari</a>, <a href="https://publications.waset.org/abstracts/search?q=Hossein%20Maghsoudi"> Hossein Maghsoudi</a>, <a href="https://publications.waset.org/abstracts/search?q=Malahat%20Givar"> Malahat Givar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this study, the three-dimensional optimal path planning of a flying robot for Terrain Following / Terrain Avoidance (TF/TA) purposes using Direct Collocation has been investigated. To this purpose, firstly, the appropriate equations of motion representing the flying robot translational movement have been described. The three-dimensional optimal path planning of the flying vehicle in terrain following/terrain avoidance maneuver is formulated as an optimal control problem. The terrain profile, as the main allowable height constraint has been modeled using Fractal Generation Method. The resulting optimal control problem is discretized by applying Direct Collocation numerical technique, and then transformed into a Nonlinear Programming Problem (NLP). The efficacy of the proposed method is demonstrated by extensive simulations, and in particular, it is verified that this approach could produce a solution satisfying almost all performance and environmental constraints encountering a low-level flying maneuver <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=path%20planning" title="path planning">path planning</a>, <a href="https://publications.waset.org/abstracts/search?q=terrain%20following" title=" terrain following"> terrain following</a>, <a href="https://publications.waset.org/abstracts/search?q=optimal%20control" title=" optimal control"> optimal control</a>, <a href="https://publications.waset.org/abstracts/search?q=nonlinear%20programming" title=" nonlinear programming"> nonlinear programming</a> </p> <a href="https://publications.waset.org/abstracts/98941/three-dimensional-optimal-path-planning-of-a-flying-robot-for-terrain-followingterrain-avoidance" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/98941.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">188</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5431</span> Optimization of Robot Motion Planning Using Biogeography Based Optimization (Bbo)</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jaber%20Nikpouri">Jaber Nikpouri</a>, <a href="https://publications.waset.org/abstracts/search?q=Arsalan%20Amralizadeh"> Arsalan Amralizadeh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In robotics manipulators, the trajectory should be optimum, thus the torque of the robot can be minimized in order to save power. This paper includes an optimal path planning scheme for a robotic manipulator. Recently, techniques based on metaheuristics of natural computing, mainly evolutionary algorithms (EA), have been successfully applied to a large number of robotic applications. In this paper, the improved BBO algorithm is used to minimize the objective function in the presence of different obstacles. The simulation represents that the proposed optimal path planning method has satisfactory performance. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=biogeography-based%20optimization" title="biogeography-based optimization">biogeography-based optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=path%20planning" title=" path planning"> path planning</a>, <a href="https://publications.waset.org/abstracts/search?q=obstacle%20detection" title=" obstacle detection"> obstacle detection</a>, <a href="https://publications.waset.org/abstracts/search?q=robotic%20manipulator" title=" robotic manipulator"> robotic manipulator</a> </p> <a href="https://publications.waset.org/abstracts/55588/optimization-of-robot-motion-planning-using-biogeography-based-optimization-bbo" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/55588.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">301</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5430</span> Iterative Linear Quadratic Regulator (iLQR) vs LQR Controllers for Quadrotor Path Tracking</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Wesam%20Jasim">Wesam Jasim</a>, <a href="https://publications.waset.org/abstracts/search?q=Dongbing%20Gu"> Dongbing Gu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents an iterative linear quadratic regulator optimal control technique to solve the problem of quadrotors path tracking. The dynamic motion equations are represented based on unit quaternion representation and include some modelled aerodynamical effects as a nonlinear part. Simulation results prove the ability and effectiveness of iLQR to stabilize the quadrotor and successfully track different paths. It also shows that iLQR controller outperforms LQR controller in terms of fast convergence and tracking errors. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=iLQR%20controller" title="iLQR controller">iLQR controller</a>, <a href="https://publications.waset.org/abstracts/search?q=optimal%20control" title=" optimal control"> optimal control</a>, <a href="https://publications.waset.org/abstracts/search?q=path%20tracking" title=" path tracking"> path tracking</a>, <a href="https://publications.waset.org/abstracts/search?q=quadrotor%20UAVs" title=" quadrotor UAVs"> quadrotor UAVs</a> </p> <a href="https://publications.waset.org/abstracts/51436/iterative-linear-quadratic-regulator-ilqr-vs-lqr-controllers-for-quadrotor-path-tracking" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/51436.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">447</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5429</span> An Optimal Path for Virtual Reality Education using Association Rules</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Adam%20Patterson">Adam Patterson</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This study analyzes the self-reported experiences of virtual reality users to develop insight into an optimal learning path for education within virtual reality. This research uses a sample of 1000 observations to statistically define factors influencing (i) immersion level and (ii) motion sickness rating for virtual reality experience respondents of college age. This paper recommends an efficient duration for each virtual reality session, to minimize sickness and maximize engagement, utilizing modern machine learning methods such as association rules. The goal of this research, in augmentation with previous literature, is to inform logistical decisions relating to implementation of pilot instruction for virtual reality at the collegiate level. Future research will include a Randomized Control Trial (RCT) to quantify the effect of virtual reality education on student learning outcomes and engagement measures. Current research aims to maximize the treatment effect within the RCT by optimizing the learning benefits of virtual reality. Results suggest significant gender heterogeneity amongst likelihood of reporting motion sickness. Females are 1.7 times more likely, than males, to report high levels of motion sickness resulting from a virtual reality experience. Regarding duration, respondents were 1.29 times more likely to select the lowest level of motion sickness after an engagement lasting between 24.3 and 42 minutes. Conversely, respondents between 42 to 60 minutes were 1.2 times more likely to select the higher levels of motion sickness. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=applications%20and%20integration%20of%20e-education" title="applications and integration of e-education">applications and integration of e-education</a>, <a href="https://publications.waset.org/abstracts/search?q=practices%20and%20cases%20in%20e-education" title=" practices and cases in e-education"> practices and cases in e-education</a>, <a href="https://publications.waset.org/abstracts/search?q=systems%20and%20technologies%20in%20e-education" title=" systems and technologies in e-education"> systems and technologies in e-education</a>, <a href="https://publications.waset.org/abstracts/search?q=technology%20adoption%20and%20diffusion%20of%20e-learning" title=" technology adoption and diffusion of e-learning"> technology adoption and diffusion of e-learning</a> </p> <a href="https://publications.waset.org/abstracts/168112/an-optimal-path-for-virtual-reality-education-using-association-rules" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/168112.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">67</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5428</span> Retraction Free Motion Approach and Its Application in Automated Robotic Edge Finishing and Inspection Processes</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20Nemer">M. Nemer</a>, <a href="https://publications.waset.org/abstracts/search?q=E.%20I.%20Konukseven"> E. I. Konukseven</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, a motion generation algorithm for a six Degrees of Freedom (DoF) robotic hand in a static environment is presented. The purpose of developing this method is to be used in the path generation of the end-effector for edge finishing and inspection processes by utilizing the CAD model of the considered workpiece. Nonetheless, the proposed algorithm may be extended to be applicable for other similar manufacturing processes. A software package programmed in the application programming interface (API) of SolidWorks generates tool path data for the robot. The proposed method significantly simplifies the given problem, resulting in a reduction in the CPU time needed to generate the path, and offers an efficient overall solution. The ABB IRB2000 robot is chosen for executing the generated tool path. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=CAD-based%20tools" title="CAD-based tools">CAD-based tools</a>, <a href="https://publications.waset.org/abstracts/search?q=edge%20deburring" title=" edge deburring"> edge deburring</a>, <a href="https://publications.waset.org/abstracts/search?q=edge%20scanning" title=" edge scanning"> edge scanning</a>, <a href="https://publications.waset.org/abstracts/search?q=offline%20programming" title=" offline programming"> offline programming</a>, <a href="https://publications.waset.org/abstracts/search?q=path%20generation" title=" path generation"> path generation</a> </p> <a href="https://publications.waset.org/abstracts/57270/retraction-free-motion-approach-and-its-application-in-automated-robotic-edge-finishing-and-inspection-processes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/57270.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">284</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5427</span> Three-Dimensional Off-Line Path Planning for Unmanned Aerial Vehicle Using Modified Particle Swarm Optimization </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Lana%20Dalawr%20Jalal">Lana Dalawr Jalal </a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper addresses the problem of ofﬂine path planning for Unmanned Aerial Vehicles (UAVs) in complex three-dimensional environment with obstacles, which is modelled by 3D Cartesian grid system. Path planning for UAVs require the computational intelligence methods to move aerial vehicles along the flight path effectively to target while avoiding obstacles. In this paper Modified Particle Swarm Optimization (MPSO) algorithm is applied to generate the optimal collision free 3D flight path for UAV. The simulations results clearly demonstrate effectiveness of the proposed algorithm in guiding UAV to the final destination by providing optimal feasible path quickly and effectively. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=obstacle%20avoidance" title="obstacle avoidance">obstacle avoidance</a>, <a href="https://publications.waset.org/abstracts/search?q=particle%20swarm%20optimization" title=" particle swarm optimization"> particle swarm optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=three-dimensional%20path%20planning%20unmanned%20aerial%20vehicles" title=" three-dimensional path planning unmanned aerial vehicles"> three-dimensional path planning unmanned aerial vehicles</a> </p> <a href="https://publications.waset.org/abstracts/26160/three-dimensional-off-line-path-planning-for-unmanned-aerial-vehicle-using-modified-particle-swarm-optimization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/26160.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">410</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5426</span> A Method to Compute Efficient 3D Helicopters Flight Trajectories Based On a Motion Polymorph-Primitives Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Konstanca%20Nikolajevic">Konstanca Nikolajevic</a>, <a href="https://publications.waset.org/abstracts/search?q=Nicolas%20Belanger"> Nicolas Belanger</a>, <a href="https://publications.waset.org/abstracts/search?q=David%20Duvivier"> David Duvivier</a>, <a href="https://publications.waset.org/abstracts/search?q=Rabie%20Ben%20Atitallah"> Rabie Ben Atitallah</a>, <a href="https://publications.waset.org/abstracts/search?q=Abdelhakim%20Artiba"> Abdelhakim Artiba</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Finding the optimal 3D path of an aerial vehicle under flight mechanics constraints is a major challenge, especially when the algorithm has to produce real-time results in flight. Kinematics models and Pythagorian Hodograph curves have been widely used in mobile robotics to solve this problematic. The level of difficulty is mainly driven by the number of constraints to be saturated at the same time while minimizing the total length of the path. In this paper, we suggest a pragmatic algorithm capable of saturating at the same time most of dimensioning helicopter 3D trajectories’ constraints like: curvature, curvature derivative, torsion, torsion derivative, climb angle, climb angle derivative, positions. The trajectories generation algorithm is able to generate versatile complex 3D motion primitives feasible by a helicopter with parameterization of the curvature and the climb angle. An upper ”motion primitives’ concatenation” algorithm is presented based. In this article we introduce a new way of designing three-dimensional trajectories based on what we call the ”Dubins gliding symmetry conjecture”. This extremely performing algorithm will be soon integrated to a real-time decisional system dealing with inflight safety issues. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=robotics" title="robotics">robotics</a>, <a href="https://publications.waset.org/abstracts/search?q=aerial%20robots" title=" aerial robots"> aerial robots</a>, <a href="https://publications.waset.org/abstracts/search?q=motion%20primitives" title=" motion primitives"> motion primitives</a>, <a href="https://publications.waset.org/abstracts/search?q=helicopter" title=" helicopter"> helicopter</a> </p> <a href="https://publications.waset.org/abstracts/25294/a-method-to-compute-efficient-3d-helicopters-flight-trajectories-based-on-a-motion-polymorph-primitives-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/25294.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">615</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5425</span> Joint Path and Push Planning among Moveable Obstacles</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Victor%20Emeli">Victor Emeli</a>, <a href="https://publications.waset.org/abstracts/search?q=Akansel%20Cosgun"> Akansel Cosgun</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper explores the navigation among movable obstacles (NAMO) problem and proposes joint path and push planning: which path to take and in what direction the obstacles should be pushed at, given a start and goal position. We present a planning algorithm for selecting a path and the obstacles to be pushed, where a rapidly-exploring random tree (RRT)-based heuristic is employed to calculate a minimal collision path. When it is necessary to apply a pushing force to slide an obstacle out of the way, the planners leverage means-end analysis through a dynamic physics simulation to determine the sequence of linear pushes to clear the necessary space. Simulation experiments show that our approach finds solutions in higher clutter percentages (up to 49%) compared to the straight-line push planner (37%) and RRT without pushing (18%). <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=motion%20planning" title="motion planning">motion planning</a>, <a href="https://publications.waset.org/abstracts/search?q=path%20planning" title=" path planning"> path planning</a>, <a href="https://publications.waset.org/abstracts/search?q=push%20planning" title=" push planning"> push planning</a>, <a href="https://publications.waset.org/abstracts/search?q=robot%20navigation" title=" robot navigation"> robot navigation</a> </p> <a href="https://publications.waset.org/abstracts/128403/joint-path-and-push-planning-among-moveable-obstacles" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/128403.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">164</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5424</span> Method to Find a ε-Optimal Control of Stochastic Differential Equation Driven by a Brownian Motion</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Francys%20Souza">Francys Souza</a>, <a href="https://publications.waset.org/abstracts/search?q=Alberto%20Ohashi"> Alberto Ohashi</a>, <a href="https://publications.waset.org/abstracts/search?q=Dorival%20Leao"> Dorival Leao</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We present a general solution for finding the ε-optimal controls for non-Markovian stochastic systems as stochastic differential equations driven by Brownian motion, which is a problem recognized as a difficult solution. The contribution appears in the development of mathematical tools to deal with modeling and control of non-Markovian systems, whose applicability in different areas is well known. The methodology used consists to discretize the problem through a random discretization. In this way, we transform an infinite dimensional problem in a finite dimensional, thereafter we use measurable selection arguments, to find a control on an explicit form for the discretized problem. Then, we prove the control found for the discretized problem is a ε-optimal control for the original problem. Our theory provides a concrete description of a rather general class, among the principals, we can highlight financial problems such as portfolio control, hedging, super-hedging, pairs-trading and others. Therefore, our main contribution is the development of a tool to explicitly the ε-optimal control for non-Markovian stochastic systems. The pathwise analysis was made through a random discretization jointly with measurable selection arguments, has provided us with a structure to transform an infinite dimensional problem into a finite dimensional. The theory is applied to stochastic control problems based on path-dependent stochastic differential equations, where both drift and diffusion components are controlled. We are able to explicitly show optimal control with our method. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=dynamic%20programming%20equation" title="dynamic programming equation">dynamic programming equation</a>, <a href="https://publications.waset.org/abstracts/search?q=optimal%20control" title=" optimal control"> optimal control</a>, <a href="https://publications.waset.org/abstracts/search?q=stochastic%20control" title=" stochastic control"> stochastic control</a>, <a href="https://publications.waset.org/abstracts/search?q=stochastic%20differential%20equation" title=" stochastic differential equation"> stochastic differential equation</a> </p> <a href="https://publications.waset.org/abstracts/94746/method-to-find-a-e-optimal-control-of-stochastic-differential-equation-driven-by-a-brownian-motion" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/94746.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">188</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5423</span> Determine the Optimal Path of Content Adaptation Services with Max Heap Tree</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Shilan%20Rahmani%20Azr">Shilan Rahmani Azr</a>, <a href="https://publications.waset.org/abstracts/search?q=Siavash%20Emtiyaz"> Siavash Emtiyaz</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Recent development in computing and communicative technologies leads to much easier mobile accessibility to the information. Users can access to the information in different places using various deceives in which the care variety of abilities. Meanwhile, the format and details of electronic documents are changing each day. In these cases, a mismatch is created between content and client’s abilities. Recently the service-oriented content adaption has been developed which the adapting tasks are dedicated to some extended services. In this method, the main problem is to choose the best appropriate service among accessible and distributed services. In this paper, a method for determining the optimal path to the best services, based on the quality control parameters and user preferences, is proposed using max heap tree. The efficiency of this method in contrast to the other previous methods of the content adaptation is related to the determining the optimal path of the best services which are measured. The results show the advantages and progresses of this method in compare of the others. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=service-oriented%20content%20adaption" title="service-oriented content adaption">service-oriented content adaption</a>, <a href="https://publications.waset.org/abstracts/search?q=QoS" title=" QoS"> QoS</a>, <a href="https://publications.waset.org/abstracts/search?q=max%20heap%20tree" title=" max heap tree"> max heap tree</a>, <a href="https://publications.waset.org/abstracts/search?q=web%20services" title=" web services"> web services</a> </p> <a href="https://publications.waset.org/abstracts/47488/determine-the-optimal-path-of-content-adaptation-services-with-max-heap-tree" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/47488.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">259</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5422</span> Multi Objective Near-Optimal Trajectory Planning of Mobile Robot </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Amar%20Khoukhi">Amar Khoukhi</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohamed%20Shahab"> Mohamed Shahab</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents the optimal control problem of mobile robot motion as a nonlinear programming problem (NLP) and solved using a direct method of numerical optimal control. The NLP is initialized with a B-Spline for which node locations are optimized using a genetic search. The system acceleration inputs and sampling periods are considered as optimization variables. Different scenarios with different objectives weights are implemented and investigated. Interesting results are found in terms of complying with the expected behavior of a mobile robot system and time-energy minimization. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=multi-objective%20control" title="multi-objective control">multi-objective control</a>, <a href="https://publications.waset.org/abstracts/search?q=non-holonomic%20systems" title=" non-holonomic systems"> non-holonomic systems</a>, <a href="https://publications.waset.org/abstracts/search?q=mobile%20robots" title=" mobile robots"> mobile robots</a>, <a href="https://publications.waset.org/abstracts/search?q=nonlinear%20programming" title=" nonlinear programming"> nonlinear programming</a>, <a href="https://publications.waset.org/abstracts/search?q=motion%20planning" title=" motion planning"> motion planning</a>, <a href="https://publications.waset.org/abstracts/search?q=B-spline" title=" B-spline"> B-spline</a>, <a href="https://publications.waset.org/abstracts/search?q=genetic%20algorithm" title=" genetic algorithm"> genetic algorithm</a> </p> <a href="https://publications.waset.org/abstracts/14286/multi-objective-near-optimal-trajectory-planning-of-mobile-robot" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/14286.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">369</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5421</span> Simultaneous Measurement of Displacement and Roll Angle of Object</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=R.%20Furutani">R. Furutani</a>, <a href="https://publications.waset.org/abstracts/search?q=K.%20Ishii"> K. Ishii</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Laser interferometers are now widely used for length and displacement measurement. In conventional methods, the optical path difference between two mirrors, one of which is a reference mirror and the other is a target mirror, is measured, as in Michelson interferometry, or two target mirrors are set up and the optical path difference between the two targets is measured, as in differential interferometry. In these interferometers, the two laser beams pass through different optical elements so that the measurement result is affected by the vibration and other effects in the optical paths. In addition, it is difficult to measure the roll angle around the optical axis. The proposed interferometer simultaneously measures both the translational motion along the optical axis and the roll motion around it by combining the retroreflective principle of the ball lens (BL) and the polarization. This interferometer detects the interferogram by the two beams traveling along the identical optical path from the beam source to BL. This principle is expected to reduce external influences by using the interferogram between the two lasers in an identical optical path. The proposed interferometer uses a BL so that the reflected light from the lens travels on the identical optical path as the incident light. After reaching the aperture of the He-Ne laser oscillator, the reflected light is reflected by a mirror with a very high reflectivity installed in the aperture and is irradiated back toward the BL. Both the first laser beam that enters the BL and the second laser beam that enters the BL after the round trip interferes with each other, enabling the measurement of displacement along the optical axis. In addition, for the measurement of the roll motion, a quarter-wave plate is installed on the optical path to change the polarization state of the laser. The polarization states of the first laser beam and second laser beam are different by the roll angle of the target. As a result, this system can measure the displacement and the roll angle of BL simultaneously. It was verified by the simulation and the experiment that the proposed optical system could measure the displacement and the roll angle simultaneously. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=common%20path%20interferometer" title="common path interferometer">common path interferometer</a>, <a href="https://publications.waset.org/abstracts/search?q=displacement%20measurement" title=" displacement measurement"> displacement measurement</a>, <a href="https://publications.waset.org/abstracts/search?q=laser%20interferometer" title=" laser interferometer"> laser interferometer</a>, <a href="https://publications.waset.org/abstracts/search?q=simultaneous%20measurement" title=" simultaneous measurement"> simultaneous measurement</a>, <a href="https://publications.waset.org/abstracts/search?q=roll%20angle%20measurement" title=" roll angle measurement"> roll angle measurement</a> </p> <a href="https://publications.waset.org/abstracts/165172/simultaneous-measurement-of-displacement-and-roll-angle-of-object" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/165172.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">89</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5420</span> Services-Oriented Model for the Regulation of Learning</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohamed%20Bendahmane">Mohamed Bendahmane</a>, <a href="https://publications.waset.org/abstracts/search?q=Brahim%20Elfalaki"> Brahim Elfalaki</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohammed%20Benattou"> Mohammed Benattou</a> </p> <p class="card-text"><strong>Abstract:</strong></p> One of the major sources of learners' professional difficulties is their heterogeneity. Whether on cognitive, social, cultural or emotional level, learners being part of the same group have many differences. These differences do not allow to apply the same learning process at all learners. Thus, an optimal learning path for one, is not necessarily the same for the other. We present in this paper a model-oriented service to offer to each learner a personalized learning path to acquire the targeted skills. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=learning%20path" title="learning path">learning path</a>, <a href="https://publications.waset.org/abstracts/search?q=web%20service" title=" web service"> web service</a>, <a href="https://publications.waset.org/abstracts/search?q=trace%20analysis" title=" trace analysis"> trace analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=personalization" title=" personalization"> personalization</a> </p> <a href="https://publications.waset.org/abstracts/50834/services-oriented-model-for-the-regulation-of-learning" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/50834.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">356</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5419</span> Path Planning for Orchard Robot Using Occupancy Grid Map in 2D Environment</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Satyam%20Raikwar">Satyam Raikwar</a>, <a href="https://publications.waset.org/abstracts/search?q=Thomas%20Herlitzius"> Thomas Herlitzius</a>, <a href="https://publications.waset.org/abstracts/search?q=Jens%20Fehrmann"> Jens Fehrmann</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In recent years, the autonomous navigation of orchard and field robots is an emerging technology of the mobile robotics in agriculture. One of the core aspects of autonomous navigation builds upon path planning, which is still a crucial issue. Generally, for simple representation, the path planning for a mobile robot is performed in a two-dimensional space, which creates a path between the start and goal point. This paper presents the automatic path planning approach for robots used in orchards and vineyards using occupancy grid maps with field consideration. The orchards and vineyards are usually structured environment and their topology is assumed to be constant over time; therefore, in this approach, an RGB image of a field is used as a working environment. These images undergone different image processing operations and then discretized into two-dimensional grid matrices. The individual grid or cell of these grid matrices represents the occupancy of the space, whether it is free or occupied. The grid matrix represents the robot workspace for motion and path planning. After the grid matrix is described, a probabilistic roadmap (PRM) path algorithm is used to create the obstacle-free path over these occupancy grids. The path created by this method was successfully verified in the test area. Furthermore, this approach is used in the navigation of the orchard robot. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=orchard%20robots" title="orchard robots">orchard robots</a>, <a href="https://publications.waset.org/abstracts/search?q=automatic%20path%20planning" title=" automatic path planning"> automatic path planning</a>, <a href="https://publications.waset.org/abstracts/search?q=occupancy%20grid" title=" occupancy grid"> occupancy grid</a>, <a href="https://publications.waset.org/abstracts/search?q=probabilistic%20roadmap" title=" probabilistic roadmap"> probabilistic roadmap</a> </p> <a href="https://publications.waset.org/abstracts/110023/path-planning-for-orchard-robot-using-occupancy-grid-map-in-2d-environment" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/110023.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">155</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5418</span> Generalized Central Paths for Convex Programming</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Li-Zhi%20Liao">Li-Zhi Liao</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The central path has played the key role in the interior point method. However, the convergence of the central path may not be true even in some convex programming problems with linear constraints. In this paper, the generalized central paths are introduced for convex programming. One advantage of the generalized central paths is that the paths will always converge to some optimal solutions of the convex programming problem for any initial interior point. Some additional theoretical properties for the generalized central paths will be also reported. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=central%20path" title="central path">central path</a>, <a href="https://publications.waset.org/abstracts/search?q=convex%20programming" title=" convex programming"> convex programming</a>, <a href="https://publications.waset.org/abstracts/search?q=generalized%20central%20path" title=" generalized central path"> generalized central path</a>, <a href="https://publications.waset.org/abstracts/search?q=interior%20point%20method" title=" interior point method"> interior point method</a> </p> <a href="https://publications.waset.org/abstracts/58039/generalized-central-paths-for-convex-programming" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/58039.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">327</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5417</span> Optimization Based Obstacle Avoidance</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=R.%20Dariani">R. Dariani</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Schmidt"> S. Schmidt</a>, <a href="https://publications.waset.org/abstracts/search?q=R.%20Kasper"> R. Kasper</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Based on a non-linear single track model which describes the dynamics of vehicle, an optimal path planning strategy is developed. Real time optimization is used to generate reference control values to allow leading the vehicle alongside a calculated lane which is optimal for different objectives such as energy consumption, run time, safety or comfort characteristics. Strict mathematic formulation of the autonomous driving allows taking decision on undefined situation such as lane change or obstacle avoidance. Based on position of the vehicle, lane situation and obstacle position, the optimization problem is reformulated in real-time to avoid the obstacle and any car crash. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=autonomous%20driving" title="autonomous driving">autonomous driving</a>, <a href="https://publications.waset.org/abstracts/search?q=obstacle%20avoidance" title=" obstacle avoidance"> obstacle avoidance</a>, <a href="https://publications.waset.org/abstracts/search?q=optimal%20control" title=" optimal control"> optimal control</a>, <a href="https://publications.waset.org/abstracts/search?q=path%20planning" title=" path planning"> path planning</a> </p> <a href="https://publications.waset.org/abstracts/13122/optimization-based-obstacle-avoidance" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/13122.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">369</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5416</span> Optimizing Network Latency with Fast Path Assignment for Incoming Flows</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Qing%20Lyu">Qing Lyu</a>, <a href="https://publications.waset.org/abstracts/search?q=Hang%20Zhu"> Hang Zhu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Various flows in the network require to go through different types of middlebox. The improper placement of network middlebox and path assignment for flows could greatly increase the network latency and also decrease the performance of network. Minimizing the total end to end latency of all the ows requires to assign path for the incoming flows. In this paper, the flow path assignment problem in regard to the placement of various kinds of middlebox is studied. The flow path assignment problem is formulated to a linear programming problem, which is very time consuming. On the other hand, a naive greedy algorithm is studied. Which is very fast but causes much more latency than the linear programming algorithm. At last, the paper presents a heuristic algorithm named FPA, which takes bottleneck link information and estimated bandwidth occupancy into consideration, and achieves near optimal latency in much less time. Evaluation results validate the effectiveness of the proposed algorithm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=flow%20path" title="flow path">flow path</a>, <a href="https://publications.waset.org/abstracts/search?q=latency" title=" latency"> latency</a>, <a href="https://publications.waset.org/abstracts/search?q=middlebox" title=" middlebox"> middlebox</a>, <a href="https://publications.waset.org/abstracts/search?q=network" title=" network"> network</a> </p> <a href="https://publications.waset.org/abstracts/103177/optimizing-network-latency-with-fast-path-assignment-for-incoming-flows" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/103177.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">207</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5415</span> ISME: Integrated Style Motion Editor for 3D Humanoid Character</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ismahafezi%20Ismail">Ismahafezi Ismail</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohd%20Shahrizal%20Sunar"> Mohd Shahrizal Sunar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The motion of a realistic 3D humanoid character is very important especially for the industries developing computer animations and games. However, this type of motion is seen with a very complex dimensional data as well as body position, orientation, and joint rotation. Integrated Style Motion Editor (ISME), on the other hand, is a method used to alter the 3D humanoid motion capture data utilised in computer animation and games development. Therefore, this study was carried out with the purpose of demonstrating a method that is able to manipulate and deform different motion styles by integrating Key Pose Deformation Technique and Trajectory Control Technique. This motion editing method allows the user to generate new motions from the original motion capture data using a simple interface control. Unlike the previous method, our method produces a realistic humanoid motion style in real time. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=computer%20animation" title="computer animation">computer animation</a>, <a href="https://publications.waset.org/abstracts/search?q=humanoid%20motion" title=" humanoid motion"> humanoid motion</a>, <a href="https://publications.waset.org/abstracts/search?q=motion%20capture" title=" motion capture"> motion capture</a>, <a href="https://publications.waset.org/abstracts/search?q=motion%20editing" title=" motion editing"> motion editing</a> </p> <a href="https://publications.waset.org/abstracts/54401/isme-integrated-style-motion-editor-for-3d-humanoid-character" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/54401.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">382</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5414</span> Optimal Placement of Phasor Measurement Units Using Gravitational Search Method</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Satyendra%20Pratap%20Singh">Satyendra Pratap Singh</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20P.%20Singh"> S. P. Singh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents a methodology using Gravitational Search Algorithm for optimal placement of Phasor Measurement Units (PMUs) in order to achieve complete observability of the power system. The objective of proposed algorithm is to minimize the total number of PMUs at the power system buses, which in turn minimize installation cost of the PMUs. In this algorithm, the searcher agents are collection of masses which interact with each other using Newton’s laws of gravity and motion. This new Gravitational Search Algorithm based method has been applied to the IEEE 14-bus, IEEE 30-bus and IEEE 118-bus test systems. Case studies reveal optimal number of PMUs with better observability by proposed method. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=gravitational%20search%20algorithm%20%28GSA%29" title="gravitational search algorithm (GSA)">gravitational search algorithm (GSA)</a>, <a href="https://publications.waset.org/abstracts/search?q=law%20of%20motion" title=" law of motion"> law of motion</a>, <a href="https://publications.waset.org/abstracts/search?q=law%20of%20gravity" title=" law of gravity"> law of gravity</a>, <a href="https://publications.waset.org/abstracts/search?q=observability" title=" observability"> observability</a>, <a href="https://publications.waset.org/abstracts/search?q=phasor%20measurement%20unit" title=" phasor measurement unit"> phasor measurement unit</a> </p> <a href="https://publications.waset.org/abstracts/24189/optimal-placement-of-phasor-measurement-units-using-gravitational-search-method" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/24189.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">507</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5413</span> An Efficient Robot Navigation Model in a Multi-Target Domain amidst Static and Dynamic Obstacles </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Michael%20Ayomoh">Michael Ayomoh</a>, <a href="https://publications.waset.org/abstracts/search?q=Adriaan%20Roux"> Adriaan Roux</a>, <a href="https://publications.waset.org/abstracts/search?q=Oyindamola%20Omotuyi"> Oyindamola Omotuyi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents an efficient robot navigation model in a multi-target domain amidst static and dynamic workspace obstacles. The problem is that of developing an optimal algorithm to minimize the total travel time of a robot as it visits all target points within its task domain amidst unknown workspace obstacles and finally return to its initial position. In solving this problem, a classical algorithm was first developed to compute the optimal number of paths to be travelled by the robot amidst the network of paths. The principle of shortest distance between robot and targets was used to compute the target point visitation order amidst workspace obstacles. Algorithm premised on the standard polar coordinate system was developed to determine the length of obstacles encountered by the robot hence giving room for a geometrical estimation of the total surface area occupied by the obstacle especially when classified as a relevant obstacle i.e. obstacle that lies in between a robot and its potential visitation point. A stochastic model was developed and used to estimate the likelihood of a dynamic obstacle bumping into the robot’s navigation path and finally, the navigation/obstacle avoidance algorithm was hinged on the hybrid virtual force field (HVFF) method. Significant modelling constraints herein include the choice of navigation path to selected target points, the possible presence of static obstacles along a desired navigation path and the likelihood of encountering a dynamic obstacle along the robot’s path and the chances of it remaining at this position as a static obstacle hence resulting in a case of re-routing after routing. The proposed algorithm demonstrated a high potential for optimal solution in terms of efficiency and effectiveness. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=multi-target" title="multi-target">multi-target</a>, <a href="https://publications.waset.org/abstracts/search?q=mobile%20robot" title=" mobile robot"> mobile robot</a>, <a href="https://publications.waset.org/abstracts/search?q=optimal%20path" title=" optimal path"> optimal path</a>, <a href="https://publications.waset.org/abstracts/search?q=static%20obstacles" title=" static obstacles"> static obstacles</a>, <a href="https://publications.waset.org/abstracts/search?q=dynamic%20obstacles" title=" dynamic obstacles"> dynamic obstacles</a> </p> <a href="https://publications.waset.org/abstracts/82853/an-efficient-robot-navigation-model-in-a-multi-target-domain-amidst-static-and-dynamic-obstacles" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/82853.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">281</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5412</span> Classification of Equations of Motion</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Amritpal%20Singh%20Nafria">Amritpal Singh Nafria</a>, <a href="https://publications.waset.org/abstracts/search?q=Rohit%20Sharma"> Rohit Sharma</a>, <a href="https://publications.waset.org/abstracts/search?q=Md.%20Shami%20Ansari"> Md. Shami Ansari</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Up to now only five different equations of motion can be derived from velocity time graph without needing to know the normal and frictional forces acting at the point of contact. In this paper we obtained all possible requisite conditions to be considering an equation as an equation of motion. After that we classified equations of motion by considering two equations as fundamental kinematical equations of motion and other three as additional kinematical equations of motion. After deriving these five equations of motion, we examine the easiest way of solving a wide variety of useful numerical problems. At the end of the paper, we discussed the importance and educational benefits of classification of equations of motion. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=velocity-time%20graph" title="velocity-time graph">velocity-time graph</a>, <a href="https://publications.waset.org/abstracts/search?q=fundamental%20equations" title=" fundamental equations"> fundamental equations</a>, <a href="https://publications.waset.org/abstracts/search?q=additional%20equations" title=" additional equations"> additional equations</a>, <a href="https://publications.waset.org/abstracts/search?q=requisite%20conditions" title=" requisite conditions"> requisite conditions</a>, <a href="https://publications.waset.org/abstracts/search?q=importance%20and%20educational%20benefits" title=" importance and educational benefits"> importance and educational benefits</a> </p> <a href="https://publications.waset.org/abstracts/15102/classification-of-equations-of-motion" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/15102.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">787</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5411</span> Motion Performance Analyses and Trajectory Planning of the Movable Leg-Foot Lander</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Shan%20Jia">Shan Jia</a>, <a href="https://publications.waset.org/abstracts/search?q=Jinbao%20Chen"> Jinbao Chen</a>, <a href="https://publications.waset.org/abstracts/search?q=Jinhua%20Zhou"> Jinhua Zhou</a>, <a href="https://publications.waset.org/abstracts/search?q=Jiacheng%20Qian"> Jiacheng Qian</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In response to the functional limitations of the fixed landers, those are to expand the detection range by the use of wheeled rovers with unavoidable path-repeatability in deep space exploration currently, a movable lander based on the leg-foot walking mechanism is presented. Firstly, a quadruped landing mechanism based on pushrod-damping is proposed. The configuration is of the bionic characteristics such as hip, knee and ankle joints, and the multi-function main/auxiliary buffers based on the crumple-energy absorption and screw-nut mechanism. Secondly, the workspace of the end of the leg-foot mechanism is solved by Monte Carlo method, and the key points on the desired trajectory of the end of the leg-foot mechanism are fitted by cubic spline curve. Finally, an optimal time-jerk trajectory based on weight coefficient is planned and analyzed by an adaptive genetic algorithm (AGA). The simulation results prove the rationality and stability of walking motion of the movable leg-foot lander in the star catalogue. In addition, this research can also provide a technical solution integrating of soft-landing, large-scale inspection and material transfer for future star catalogue exploration, and can even serve as the technical basis for developing the reusable landers. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=motion%20performance" title="motion performance">motion performance</a>, <a href="https://publications.waset.org/abstracts/search?q=trajectory%20planning" title=" trajectory planning"> trajectory planning</a>, <a href="https://publications.waset.org/abstracts/search?q=movable" title=" movable"> movable</a>, <a href="https://publications.waset.org/abstracts/search?q=leg-foot%20lander" title=" leg-foot lander"> leg-foot lander</a> </p> <a href="https://publications.waset.org/abstracts/108567/motion-performance-analyses-and-trajectory-planning-of-the-movable-leg-foot-lander" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/108567.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">139</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5410</span> Planning a Haemodialysis Process by Minimum Time Control of Hybrid Systems with Sliding Motion</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Radoslaw%20Pytlak">Radoslaw Pytlak</a>, <a href="https://publications.waset.org/abstracts/search?q=Damian%20Suski"> Damian Suski</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The aim of the paper is to provide a computational tool for planning a haemodialysis process. It is shown that optimization methods can be used to obtain the most effective treatment focused on removing both urea and phosphorus during the process. In order to achieve that, the IV–compartment model of phosphorus kinetics is applied. This kinetics model takes into account a rebound phenomenon that can occur during haemodialysis and results in a hybrid model of the process. Furthermore, vector fields associated with the model equations are such that it is very likely that using the most intuitive objective functions in the planning problem could lead to solutions which include sliding motions. Therefore, building computational tools for solving the problem of planning a haemodialysis process has required constructing numerical algorithms for solving optimal control problems with hybrid systems. The paper concentrates on minimum time control of hybrid systems since this control objective is the most suitable for the haemodialysis process considered in the paper. The presented approach to optimal control problems with hybrid systems is different from the others in several aspects. First of all, it is assumed that a hybrid system can exhibit sliding modes. Secondly, the system’s motion on the switching surface is described by index 2 differential–algebraic equations, and that guarantees accurate tracking of the sliding motion surface. Thirdly, the gradients of the problem’s functionals are evaluated with the help of adjoint equations. The adjoint equations presented in the paper take into account sliding motion and exhibit jump conditions at transition times. The optimality conditions in the form of the weak maximum principle for optimal control problems with hybrid systems exhibiting sliding modes and with piecewise constant controls are stated. The presented sensitivity analysis can be used to construct globally convergent algorithms for solving considered problems. The paper presents numerical results of solving the haemodialysis planning problem. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=haemodialysis%20planning%20process" title="haemodialysis planning process">haemodialysis planning process</a>, <a href="https://publications.waset.org/abstracts/search?q=hybrid%20systems" title=" hybrid systems"> hybrid systems</a>, <a href="https://publications.waset.org/abstracts/search?q=optimal%20control" title=" optimal control"> optimal control</a>, <a href="https://publications.waset.org/abstracts/search?q=sliding%20motion" title=" sliding motion"> sliding motion</a> </p> <a href="https://publications.waset.org/abstracts/128983/planning-a-haemodialysis-process-by-minimum-time-control-of-hybrid-systems-with-sliding-motion" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/128983.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">194</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5409</span> Path Planning for Unmanned Aerial Vehicles in Constrained Environments for Locust Elimination</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Aadiv%20Shah">Aadiv Shah</a>, <a href="https://publications.waset.org/abstracts/search?q=Hari%20Nair"> Hari Nair</a>, <a href="https://publications.waset.org/abstracts/search?q=Vedant%20Mittal"> Vedant Mittal</a>, <a href="https://publications.waset.org/abstracts/search?q=Alice%20Cheeran"> Alice Cheeran</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Present-day agricultural practices such as blanket spraying not only lead to excessive usage of pesticides but also harm the overall crop yield. This paper introduces an algorithm to optimize the traversal of an unmanned aerial vehicle (UAV) in constrained environments. The proposed system focuses on the agricultural application of targeted spraying for locust elimination. Given a satellite image of a farm, target zones that are prone to locust swarm formation are detected through the calculation of the normalized difference vegetation index (NDVI). This is followed by determining the optimal path for traversal of a UAV through these target zones using the proposed algorithm in order to perform pesticide spraying in the most efficient manner possible. Unlike the classic travelling salesman problem involving point-to-point optimization, the proposed algorithm determines an optimal path for multiple regions, independent of its geometry. Finally, the paper explores the idea of implementing reinforcement learning to model complex environmental behaviour and make the path planning mechanism for UAVs agnostic to external environment changes. This system not only presents a solution to the enormous losses incurred due to locust attacks but also an efficient way to automate agricultural practices across the globe in order to improve farmer ergonomics. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=locust" title="locust">locust</a>, <a href="https://publications.waset.org/abstracts/search?q=NDVI" title=" NDVI"> NDVI</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization" title=" optimization"> optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=path%20planning" title=" path planning"> path planning</a>, <a href="https://publications.waset.org/abstracts/search?q=reinforcement%20learning" title=" reinforcement learning"> reinforcement learning</a>, <a href="https://publications.waset.org/abstracts/search?q=UAV" title=" UAV"> UAV</a> </p> <a href="https://publications.waset.org/abstracts/138548/path-planning-for-unmanned-aerial-vehicles-in-constrained-environments-for-locust-elimination" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/138548.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">248</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5408</span> Hybrid Gravity Gradient Inversion-Ant Colony Optimization Algorithm for Motion Planning of Mobile Robots</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Meng%20Wu">Meng Wu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Motion planning is a common task required to be fulfilled by robots. A strategy combining Ant Colony Optimization (ACO) and gravity gradient inversion algorithm is proposed for motion planning of mobile robots. In this paper, in order to realize optimal motion planning strategy, the cost function in ACO is designed based on gravity gradient inversion algorithm. The obstacles around mobile robot can cause gravity gradient anomalies; the gradiometer is installed on the mobile robot to detect the gravity gradient anomalies. After obtaining the anomalies, gravity gradient inversion algorithm is employed to calculate relative distance and orientation between mobile robot and obstacles. The relative distance and orientation deduced from gravity gradient inversion algorithm is employed as cost function in ACO algorithm to realize motion planning. The proposed strategy is validated by the simulation and experiment results. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=motion%20planning" title="motion planning">motion planning</a>, <a href="https://publications.waset.org/abstracts/search?q=gravity%20gradient%20inversion%20algorithm" title=" gravity gradient inversion algorithm"> gravity gradient inversion algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=ant%20colony%20optimization" title=" ant colony optimization"> ant colony optimization</a> </p> <a href="https://publications.waset.org/abstracts/110462/hybrid-gravity-gradient-inversion-ant-colony-optimization-algorithm-for-motion-planning-of-mobile-robots" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/110462.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">137</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5407</span> Investigating the Motion of a Viscous Droplet in Natural Convection Using the Level Set Method</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Isadora%20Bugarin">Isadora Bugarin</a>, <a href="https://publications.waset.org/abstracts/search?q=Taygoara%20F.%20de%20Oliveira"> Taygoara F. de Oliveira</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Binary fluids and emulsions, in general, are present in a vast range of industrial, medical, and scientific applications, showing complex behaviors responsible for defining the flow dynamics and the system operation. However, the literature describing those highlighted fluids in non-isothermal models is currently still limited. The present work brings a detailed investigation on droplet migration due to natural convection in square enclosure, aiming to clarify the effects of drop viscosity on the flow dynamics by showing how distinct viscosity ratios (droplet/ambient fluid) influence the drop motion and the final movement pattern kept on stationary regimes. The analysis was taken by observing distinct combinations of Rayleigh number, drop initial position, and viscosity ratios. The Navier-Stokes and Energy equations were solved considering the Boussinesq approximation in a laminar flow using the finite differences method combined with the Level Set method for binary flow solution. Previous results collected by the authors showed that the Rayleigh number and the drop initial position affect drastically the motion pattern of the droplet. For Ra ≥ 10⁴, two very marked behaviors were observed accordingly with the initial position: the drop can travel either a helical path towards the center or a cyclic circular path resulting in a closed cycle on the stationary regime. The variation of viscosity ratio showed a significant alteration of pattern, exposing a large influence on the droplet path, capable of modifying the flow’s behavior. Analyses on viscosity effects on the flow’s unsteady Nusselt number were also performed. Among the relevant contributions proposed in this work is the potential use of the flow initial conditions as a mechanism to control the droplet migration inside the enclosure. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=binary%20fluids" title="binary fluids">binary fluids</a>, <a href="https://publications.waset.org/abstracts/search?q=droplet%20motion" title=" droplet motion"> droplet motion</a>, <a href="https://publications.waset.org/abstracts/search?q=level%20set%20method" title=" level set method"> level set method</a>, <a href="https://publications.waset.org/abstracts/search?q=natural%20convection" title=" natural convection"> natural convection</a>, <a href="https://publications.waset.org/abstracts/search?q=viscosity" title=" viscosity"> viscosity</a> </p> <a href="https://publications.waset.org/abstracts/127629/investigating-the-motion-of-a-viscous-droplet-in-natural-convection-using-the-level-set-method" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/127629.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">117</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5406</span> An Optimal Control Model to Determine Body Forces of Stokes Flow</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yuanhao%20Gao">Yuanhao Gao</a>, <a href="https://publications.waset.org/abstracts/search?q=Pin%20Lin"> Pin Lin</a>, <a href="https://publications.waset.org/abstracts/search?q=Kees%20Weijer"> Kees Weijer</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we will determine the external body force distribution with analysis of stokes fluid motion using mathematical modelling and numerical approaching. The body force distribution is regarded as the unknown variable and could be determined by the idea of optimal control theory. The Stokes flow motion and its velocity are generated by given forces in a unit square domain. A regularized objective functional is built to match the numerical result of flow velocity with the generated velocity data. So that the force distribution could be determined by minimizing the value of objective functional, which is also the difference between the numerical and experimental velocity. Then after utilizing the Lagrange multiplier method, some partial differential equations are formulated consisting the optimal control system to solve. Finite element method and conjugate gradient method are used to discretize equations and deduce the iterative expression of target body force to compute the velocity numerically and body force distribution. Programming environment FreeFEM++ supports the implementation of this model. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=optimal%20control%20model" title="optimal control model">optimal control model</a>, <a href="https://publications.waset.org/abstracts/search?q=Stokes%20equation" title=" Stokes equation"> Stokes equation</a>, <a href="https://publications.waset.org/abstracts/search?q=finite%20element%20method" title=" finite element method"> finite element method</a>, <a href="https://publications.waset.org/abstracts/search?q=conjugate%20gradient%20method" title=" conjugate gradient method"> conjugate gradient method</a> </p> <a href="https://publications.waset.org/abstracts/54716/an-optimal-control-model-to-determine-body-forces-of-stokes-flow" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/54716.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">405</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5405</span> Adaptive Motion Planning for 6-DOF Robots Based on Trigonometric Functions</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jincan%20Li">Jincan Li</a>, <a href="https://publications.waset.org/abstracts/search?q=Mingyu%20Gao"> Mingyu Gao</a>, <a href="https://publications.waset.org/abstracts/search?q=Zhiwei%20He"> Zhiwei He</a>, <a href="https://publications.waset.org/abstracts/search?q=Yuxiang%20Yang"> Yuxiang Yang</a>, <a href="https://publications.waset.org/abstracts/search?q=Zhongfei%20Yu"> Zhongfei Yu</a>, <a href="https://publications.waset.org/abstracts/search?q=Yuanyuan%20Liu"> Yuanyuan Liu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Building an appropriate motion model is crucial for trajectory planning of robots and determines the operational quality directly. An adaptive acceleration and deceleration motion planning based on trigonometric functions for the end-effector of 6-DOF robots in Cartesian coordinate system is proposed in this paper. This method not only achieves the smooth translation motion and rotation motion by constructing a continuous jerk model, but also automatically adjusts the parameters of trigonometric functions according to the variable inputs and the kinematic constraints. The results of computer simulation show that this method is correct and effective to achieve the adaptive motion planning for linear trajectories. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=kinematic%20constraints" title="kinematic constraints">kinematic constraints</a>, <a href="https://publications.waset.org/abstracts/search?q=motion%20planning" title=" motion planning"> motion planning</a>, <a href="https://publications.waset.org/abstracts/search?q=trigonometric%20function" title=" trigonometric function"> trigonometric function</a>, <a href="https://publications.waset.org/abstracts/search?q=6-DOF%20robots" title=" 6-DOF robots"> 6-DOF robots</a> </p> <a href="https://publications.waset.org/abstracts/87082/adaptive-motion-planning-for-6-dof-robots-based-on-trigonometric-functions" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/87082.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">271</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5404</span> Application of Heuristic Integration Ant Colony Optimization in Path Planning</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Zeyu%20Zhang">Zeyu Zhang</a>, <a href="https://publications.waset.org/abstracts/search?q=Guisheng%20Yin"> Guisheng Yin</a>, <a href="https://publications.waset.org/abstracts/search?q=Ziying%20Zhang"> Ziying Zhang</a>, <a href="https://publications.waset.org/abstracts/search?q=Liguo%20Zhang"> Liguo Zhang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper mainly studies the path planning method based on ant colony optimization (ACO), and proposes heuristic integration ant colony optimization (HIACO). This paper not only analyzes and optimizes the principle, but also simulates and analyzes the parameters related to the application of HIACO in path planning. Compared with the original algorithm, the improved algorithm optimizes probability formula, tabu table mechanism and updating mechanism, and introduces more reasonable heuristic factors. The optimized HIACO not only draws on the excellent ideas of the original algorithm, but also solves the problems of premature convergence, convergence to the sub optimal solution and improper exploration to some extent. HIACO can be used to achieve better simulation results and achieve the desired optimization. Combined with the probability formula and update formula, several parameters of HIACO are tested. This paper proves the principle of the HIACO and gives the best parameter range in the research of path planning. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=ant%20colony%20optimization" title="ant colony optimization">ant colony optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=heuristic%20integration" title=" heuristic integration"> heuristic integration</a>, <a href="https://publications.waset.org/abstracts/search?q=path%20planning" title=" path planning"> path planning</a>, <a href="https://publications.waset.org/abstracts/search?q=probability%20formula" title=" probability formula"> probability formula</a> </p> <a href="https://publications.waset.org/abstracts/115269/application-of-heuristic-integration-ant-colony-optimization-in-path-planning" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/115269.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">250</span> </span> </div> </div> <ul class="pagination"> <li class="page-item disabled"><span class="page-link">&lsaquo;</span></li> <li class="page-item active"><span class="page-link">1</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=optimal%20path%20motion&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=optimal%20path%20motion&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=optimal%20path%20motion&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=optimal%20path%20motion&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=optimal%20path%20motion&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=optimal%20path%20motion&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=optimal%20path%20motion&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=optimal%20path%20motion&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=optimal%20path%20motion&page=10">10</a></li> <li class="page-item disabled"><span class="page-link">...</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=optimal%20path%20motion&page=181">181</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=optimal%20path%20motion&page=182">182</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=optimal%20path%20motion&page=2" rel="next">&rsaquo;</a></li> </ul> </div> </main> <footer> <div id="infolinks" class="pt-3 pb-2"> <div class="container"> <div style="background-color:#f5f5f5;" class="p-3"> <div class="row"> <div class="col-md-2"> <ul class="list-unstyled"> About <li><a href="https://waset.org/page/support">About Us</a></li> <li><a href="https://waset.org/page/support#legal-information">Legal</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/WASET-16th-foundational-anniversary.pdf">WASET celebrates its 16th foundational anniversary</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Account <li><a href="https://waset.org/profile">My Account</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Explore <li><a href="https://waset.org/disciplines">Disciplines</a></li> <li><a href="https://waset.org/conferences">Conferences</a></li> <li><a href="https://waset.org/conference-programs">Conference Program</a></li> <li><a href="https://waset.org/committees">Committees</a></li> <li><a href="https://publications.waset.org">Publications</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Research <li><a href="https://publications.waset.org/abstracts">Abstracts</a></li> <li><a href="https://publications.waset.org">Periodicals</a></li> <li><a href="https://publications.waset.org/archive">Archive</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Open Science <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Philosophy.pdf">Open Science Philosophy</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Award.pdf">Open Science Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Society-Open-Science-and-Open-Innovation.pdf">Open Innovation</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Postdoctoral-Fellowship-Award.pdf">Postdoctoral Fellowship Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Scholarly-Research-Review.pdf">Scholarly Research Review</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Support <li><a href="https://waset.org/page/support">Support</a></li> <li><a href="https://waset.org/profile/messages/create">Contact Us</a></li> <li><a href="https://waset.org/profile/messages/create">Report Abuse</a></li> </ul> </div> </div> </div> </div> </div> <div class="container text-center"> <hr style="margin-top:0;margin-bottom:.3rem;"> <a href="https://creativecommons.org/licenses/by/4.0/" target="_blank" class="text-muted small">Creative Commons Attribution 4.0 International License</a> <div id="copy" class="mt-2">© 2024 World Academy of Science, Engineering and Technology</div> </div> </footer> <a href="javascript:" id="return-to-top"><i class="fas fa-arrow-up"></i></a> <div class="modal" id="modal-template"> <div class="modal-dialog"> <div class="modal-content"> <div class="row m-0 mt-1"> <div class="col-md-12"> <button type="button" class="close" data-dismiss="modal" aria-label="Close"><span aria-hidden="true">×</span></button> </div> </div> <div class="modal-body"></div> </div> </div> </div> <script src="https://cdn.waset.org/static/plugins/jquery-3.3.1.min.js"></script> <script src="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/js/bootstrap.bundle.min.js"></script> <script src="https://cdn.waset.org/static/js/site.js?v=150220211556"></script> <script> jQuery(document).ready(function() { /*jQuery.get("https://publications.waset.org/xhr/user-menu", function (response) { jQuery('#mainNavMenu').append(response); });*/ jQuery.get({ url: "https://publications.waset.org/xhr/user-menu", cache: false }).then(function(response){ jQuery('#mainNavMenu').append(response); }); }); </script> </body> </html>