**Commenced**in January 2007

**Frequency:**Monthly

**Edition:**International

**Paper Count:**1459

# Search results for: mean free path

##### 1459 Geometry Design Supported by Minimizing and Visualizing Collision in Dynamic Packing

**Authors:**
Johan Segeborn,
Johan S. Carlson,
Robert Bohlin,
Rikard Söderberg

**Abstract:**

**Keywords:**
Dynamic packing,
path planning,
shrinking.

##### 1458 Three-Dimensional Off-Line Path Planning for Unmanned Aerial Vehicle Using Modified Particle Swarm Optimization

**Authors:**
Lana Dalawr Jalal

**Abstract:**

**Keywords:**
Obstacle Avoidance,
Particle Swarm Optimization,
Three-Dimensional Path Planning Unmanned Aerial Vehicles.

##### 1457 Decomposition of Graphs into Induced Paths and Cycles

**Authors:**
I. Sahul Hamid,
Abraham V. M.

**Abstract:**

A decomposition of a graph G is a collection ψ of subgraphs H1,H2, . . . , Hr of G such that every edge of G belongs to exactly one Hi. If each Hi is either an induced path or an induced cycle in G, then ψ is called an induced path decomposition of G. The minimum cardinality of an induced path decomposition of G is called the induced path decomposition number of G and is denoted by πi(G). In this paper we initiate a study of this parameter.

**Keywords:**
Path decomposition,
Induced path decomposition,
Induced path decomposition number.

##### 1456 Memetic Algorithm Based Path Planning for a Mobile Robot

**Authors:**
Neda Shahidi,
Hadi Esmaeilzadeh,
Marziye Abdollahi,
Caro Lucas

**Abstract:**

In this paper, the problem of finding the optimal collision free path for a mobile robot, the path planning problem, is solved using an advanced evolutionary algorithm called memetic algorithm. What is new in this work is a novel representation of solutions for evolutionary algorithms that is efficient, simple and also compatible with memetic algorithm. The new representation makes it possible to solve the problem with a small population and in a few generations. It also makes the genetic operator simple and allows using an efficient local search operator within the evolutionary algorithm. The proposed algorithm is applied to two instances of path planning problem and the results are available.

**Keywords:**
Path planning problem,
Memetic Algorithm,
Representation.

##### 1455 The Same or Not the Same - On the Variety of Mechanisms of Path Dependence

**Authors:**
Jürgen Beyer

**Abstract:**

**Keywords:**
path dependence,
increasing returns,
historicalinstitutionalism,
lock-in.

##### 1454 Retraction Free Motion Approach and Its Application in Automated Robotic Edge Finishing and Inspection Processes

**Authors:**
M. Nemer,
E. I. Konukseven

**Abstract:**

**Keywords:**
Offline programming,
CAD-based tools,
edge deburring,
edge scanning,
path generation.

##### 1453 Using Multi-Thread Technology Realize Most Short-Path Parallel Algorithm

**Authors:**
Chang-le Lu,
Yong Chen

**Abstract:**

**Keywords:**
Dijkstra algorithm,
parallel algorithms,
multi-thread
technology,
most short-path,
ratio.

##### 1452 An UML Statechart Diagram-Based MM-Path Generation Approach for Object-Oriented Integration Testing

**Authors:**
Ruilian Zhao,
Ling Lin

**Abstract:**

MM-Path, an acronym for Method/Message Path, describes the dynamic interactions between methods in object-oriented systems. This paper discusses the classifications of MM-Path, based on the characteristics of object-oriented software. We categorize it according to the generation reasons, the effect scope and the composition of MM-Path. A formalized representation of MM-Path is also proposed, which has considered the influence of state on response method sequences of messages. .Moreover, an automatic MM-Path generation approach based on UML Statechart diagram has been presented, and the difficulties in identifying and generating MM-Path can be solved. . As a result, it provides a solid foundation for further research on test cases generation based on MM-Path.

**Keywords:**
MM-Path,
Message Sequence,
Object-Oriented Integration Testing,
Response Method Sequence,
UML Statechart Diagram.

##### 1451 Loop-free Local Path Repair Strategy for Directed Diffusion

**Authors:**
Basma M. Mohammad El-Basioni,
Sherine M. Abd El-kader,
Hussein S. Eissa

**Abstract:**

**Keywords:**
Attribute-value based naming scheme,
data
gathering,
data-centric routing,
energy-efficiency,
locality,
wireless
sensor network.

##### 1450 Induced Acyclic Path Decomposition in Graphs

**Authors:**
Abraham V. M.,
I. Sahul Hamid

**Abstract:**

**Keywords:**
Cycle decomposition,
Induced acyclic path decomposition,
Induced acyclic path decomposition number.

##### 1449 A Feasible Path Selection QoS Routing Algorithm with two Constraints in Packet Switched Networks

**Authors:**
P.S.Prakash,
S.Selvan

**Abstract:**

**Keywords:**
feasible path,
multiple constraints,
path selection,
QoS routing

##### 1448 1−Skeleton Resolution of Free Simplicial Algebras with Given CW−Basis

**Authors:**
Ali Mutlu,
Berrin Mutlu

**Abstract:**

In this paper we use the definition of CW basis of a free simplicial algebra. Using the free simplicial algebra, it is shown to construct free or totally free 2−crossed modules on suitable construction data with given a CW−basis of the free simplicial algebra. We give applications free crossed squares, free squared complexes and free 2−crossed complexes by using of 1(one) skeleton resolution of a step by step construction of the free simplicial algebra with a given CW−basis.

**Keywords:**
Free crossed square,
Free 2−crossed modules,
Free
simplicial algebra,
Free square complexes,
Free 2−crossed complexes
CW−basis,
1−skeleton.
A. M. S.Classification:[2000] 18D35,
18G30,
18G50,
18G55,
55Q05,
55Q20.

##### 1447 Robot Path Planning in 3D Space Using Binary Integer Programming

**Authors:**
Ellips Masehian,
Golnaz Habibi

**Abstract:**

**Keywords:**
3D C-space,
Binary Integer Programming (BIP),
Delaunay Tessellation,
Robot Motion Planning.

##### 1446 Comparison of GSA, SA and PSO Based Intelligent Controllers for Path Planning of Mobile Robot in Unknown Environment

**Authors:**
P. K. Panigrahi,
Saradindu Ghosh,
Dayal R. Parhi

**Abstract:**

Now-a-days autonomous mobile robots have found applications in diverse fields. An autonomous robot system must be able to behave in an intelligent manner to deal with complex and changing environment. This work proposes the performance of path planning and navigation of autonomous mobile robot using Gravitational Search Algorithm (GSA), Simulated Annealing (SA) and Particle Swarm optimization (PSO) based intelligent controllers in an unstructured environment. The approach not only finds a valid collision free path but also optimal one. The main aim of the work is to minimize the length of the path and duration of travel from a starting point to a target while moving in an unknown environment with obstacles without collision. Finally, a comparison is made between the three controllers, it is found that the path length and time duration made by the robot using GSA is better than SA and PSO based controllers for the same work.

**Keywords:**
Autonomous Mobile Robot,
Gravitational Search Algorithm,
Particle Swarm Optimization,
Simulated Annealing Algorithm.

##### 1445 Module and Comodule Structures on Path Space

**Abstract:**

*kQ*, there is a trivial

*kQ*-module structure determined by the multiplication of path algebra

^{a}*kQ*and a trivial

^{a }*kQ*-comodule structure determined by the comultiplication of path coalgebra

^{c}*kQ*. In this paper, on path space

^{c}*kQ*, a nontrivial

*kQ*-module structure is defined, and it is proved that this nontrivial left

^{a}*kQ*-module structure is isomorphic to the dual module structure of trivial right

^{a}*kQ*-comodule. Dually, on path space

^{c}*kQ*, a nontrivial

*kQ*-comodule structure is defined, and it is proved that this nontrivial right

^{c}*kQ*-comodule structure is isomorphic to the dual comodule structure of trivial left

^{c}*kQ*-module. Finally, the trivial and nontrivial module structures on path space are compared from the aspect of submodule, and the trivial and nontrivial comodule structures on path space are compared from the aspect of subcomodule.

^{a}**Keywords:**
Quiver,
path space,
module,
comodule,
dual.

##### 1444 A Review on Comparative Analysis of Path Planning and Collision Avoidance Algorithms

**Authors:**
Divya Agarwal,
Pushpendra S. Bharti

**Abstract:**

Autonomous mobile robots (AMR) are expected as smart tools for operations in every automation industry. Path planning and obstacle avoidance is the backbone of AMR as robots have to reach their goal location avoiding obstacles while traversing through optimized path defined according to some criteria such as distance, time or energy. Path planning can be classified into global and local path planning where environmental information is known and unknown/partially known, respectively. A number of sensors are used for data collection. A number of algorithms such as artificial potential field (APF), rapidly exploring random trees (RRT), bidirectional RRT, Fuzzy approach, Purepursuit, A* algorithm, vector field histogram (VFH) and modified local path planning algorithm, etc. have been used in the last three decades for path planning and obstacle avoidance for AMR. This paper makes an attempt to review some of the path planning and obstacle avoidance algorithms used in the field of AMR. The review includes comparative analysis of simulation and mathematical computations of path planning and obstacle avoidance algorithms using MATLAB 2018a. From the review, it could be concluded that different algorithms may complete the same task (i.e. with a different set of instructions) in less or more time, space, effort, etc.

**Keywords:**
Autonomous mobile robots,
obstacle avoidance,
path planning,
and processing time.

##### 1443 The Problem of Using the Calculation of the Critical Path to Solver Instances of the Job Shop Scheduling Problem

**Authors:**
Marco Antonio Cruz-Chávez,
Juan Frausto-Solís,
Fernando Ramos-Quintana

**Abstract:**

A procedure commonly used in Job Shop Scheduling Problem (JSSP) to evaluate the neighborhoods functions that use the non-deterministic algorithms is the calculation of the critical path in a digraph. This paper presents an experimental study of the cost of computation that exists when the calculation of the critical path in the solution for instances in which a JSSP of large size is involved. The results indicate that if the critical path is use in order to generate neighborhoods in the meta-heuristics that are used in JSSP, an elevated cost of computation exists in spite of the fact that the calculation of the critical path in any digraph is of polynomial complexity.

**Keywords:**
Job Shop,
CPM,
critical path,
neighborhood,
meta-heuristic.

##### 1442 An Improved Transfer Logic of the Two-Path Algorithm for Acoustic Echo Cancellation

**Abstract:**

**Keywords:**
Acoustic echo cancellation,
Echo return lossenhancement (ERLE),
Two-path algorithm,
Transfer logic

##### 1441 The Effect of Tool Path Strategy on Surface and Dimension in High Speed Milling

**Authors:**
A. Razavykia,
A. Esmaeilzadeh,
S. Iranmanesh

**Abstract:**

**Keywords:**
CAD/CAM software,
milling,
orthopedic implants,
tool path strategy.

##### 1440 An Examination and Validation of the Theoretical Resistivity-Temperature Relationship for Conductors

**Authors:**
Fred Lacy

**Abstract:**

Electrical resistivity is a fundamental parameter of metals or electrical conductors. Since resistivity is a function of temperature, in order to completely understand the behavior of metals, a temperature dependent theoretical model is needed. A model based on physics principles has recently been developed to obtain an equation that relates electrical resistivity to temperature. This equation is dependent upon a parameter associated with the electron travel time before being scattered, and a parameter that relates the energy of the atoms and their separation distance. Analysis of the energy parameter reveals that the equation is optimized if the proportionality term in the equation is not constant but varies over the temperature range. Additional analysis reveals that the theoretical equation can be used to determine the mean free path of conduction electrons, the number of defects in the atomic lattice, and the ‘equivalent’ charge associated with the metallic bonding of the atoms. All of this analysis provides validation for the theoretical model and provides insight into the behavior of metals where performance is affected by temperatures (e.g., integrated circuits and temperature sensors).

**Keywords:**
Callendar–van Dusen,
conductivity,
mean free path,
resistance temperature detector,
temperature sensor.

##### 1439 Induced Graphoidal Covers in a Graph

**Authors:**
K. Ratan Singh,
P. K. Das

**Abstract:**

An induced graphoidal cover of a graph G is a collection ψ of (not necessarily open) paths in G such that every path in ψ has at least two vertices, every vertex of G is an internal vertex of at most one path in ψ, every edge of G is in exactly one path in ψ and every member of ψ is an induced cycle or an induced path. The minimum cardinality of an induced graphoidal cover of G is called the induced graphoidal covering number of G and is denoted by ηi(G) or ηi. Here we find induced graphoidal cover for some classes of graphs.

**Keywords:**
Graphoidal cover,
Induced graphoidal cover,
Induced graphoidal covering number.

##### 1438 An Approach to the Solving Non-Steiner Minimum Link Path Problem

**Authors:**
V. Tereshchenko,
A. Tregubenko

**Abstract:**

In this study we survey the method for fast finding a minimum link path between two arbitrary points within a simple polygon, which can pass only through the vertices, with preprocessing.

**Keywords:**
Minimum link path,
simple polygon,
Steiner points,
optimal algorithm.

##### 1437 Thermal Analysis of the Current Path from Circuit Breakers Using Finite Element Method

**Authors:**
Adrian T. Plesca

**Abstract:**

**Keywords:**
Current path,
power circuit breakers,
temperature
distribution,
thermal analysis.

##### 1436 Induced Acyclic Graphoidal Covers in a Graph

**Authors:**
K. Ratan Singh,
P. K. Das

**Abstract:**

**Keywords:**
Graphoidal cover,
Induced acyclic graphoidal cover,
Induced acyclic graphoidal covering number.

##### 1435 Geometric Data Structures and Their Selected Applications

**Authors:**
Miloš Šeda

**Abstract:**

**Keywords:**
motion planning,
spanning tree,
Steiner tree,
Delaunay triangulation,
Voronoi diagram.

##### 1434 Path Planning of a Robot Manipulator using Retrieval RRT Strategy

**Authors:**
K. Oh,
J. P. Hwang,
E. Kim,
H. Lee

**Abstract:**

**Keywords:**
Path planning,
RRT,
6 DOF manipulator,
SVM.

##### 1433 Optimal Path Planning under Priori Information in Stochastic, Time-varying Networks

**Authors:**
Siliang Wang,
Minghui Wang,
Jun Hu

**Abstract:**

**Keywords:**
pruning method,
stochastic,
time-varying networks,
optimal path planning.

##### 1432 Optimizing Network Latency with Fast Path Assignment for Incoming Flows

**Abstract:**

**Keywords:**
Latency,
Fast path assignment,
Bottleneck link.

##### 1431 Mobile Robot Path Planning Utilizing Probability Recursive Function

**Authors:**
Ethar H. Khalil,
Bahaa I. Kazem

**Abstract:**

**Keywords:**
Mobile robot,
path planning,
Bezier curve.

##### 1430 The Effect of Critical Activity on Critical Path and Project Duration in Precedence Diagram Method

**Abstract:**

The additional relationships i.e., start-to-start, finish-to-finish, and start-to-finish, between activity in Precedence Diagram Method (PDM) provides a more flexible schedule than traditional Critical Path Method (CPM). But, changing the duration of critical activities in the PDM network will have an anomalous effect on the critical path and the project completion date. In this study, we classified the critical activities in two groups i.e., 1. activity on single critical path and 2. activity on multi-critical paths, and six classes i.e., normal, reverse, neutral, perverse, decrease-reverse and increase-normal, based on their effects on project duration in PDM. Furthermore, we determined the maximum float of time by which the duration each type of critical activities can be changed without effecting the project duration. This study would help the project manager to clearly understand the behavior of each critical activity on critical path, and he/she would be able to change the project duration by shortening or lengthening activities based on project budget and project deadline.

**Keywords:**
Construction project management,
critical path method,
project scheduling,
precedence diagram method.