4 research outputs found
Robot Path Planning of Improved Adaptive Ant Colony System Algorithm Based on Dijkstra
No full textPath planning is one of the key technologies of robot. Aiming at the problems of slow convergence speed and inefficient search of traditional Ant Colony System Algorithm, an adaptive Ant Colony System Algorithm based on Dijkstra is proposed in the paper. Firstly, Dijkstra algorithm is applied to searching the initial path in the grid environment, constructing the initial path, optimizing the initial pheromone in the region, therefore, the Ant Colony System Algorithm avoid falling into blind search in the initial stage; In the transition probability, the disguised angle probability function and parameter adaptive pseudo-random proportion rule are introduced to improve the search efficiency and convergence speed of the algorithm, and eliminate the inferior ant path; Finally, B-spline interpolation curve is used to smooth the path. Compared with the traditional Ant Colony System Algorithm, the simulation results in the grid environment demonstrating its effectiveness to improve convergence speed and to enhance search efficiency are provided. The characteristics of the improved Ant Colony System Algorithm are faster convergence speed and better planning
sj-docx-2-hsx-10.1177_10887679221129850 – Supplemental material for The (Mis)utilization of Cues During Deception Detection in 911 Homicide Calls
No full textSupplemental material, sj-docx-2-hsx-10.1177_10887679221129850 for The (Mis)utilization of Cues During Deception Detection in 911 Homicide Calls by Patrick Markey, Erika Feeney, Brooke Berry, Alec Martin and Erica Slotter in Homicide Studies</p
sj-docx-1-hsx-10.1177_10887679221129850 – Supplemental material for The (Mis)utilization of Cues During Deception Detection in 911 Homicide Calls
No full textSupplemental material, sj-docx-1-hsx-10.1177_10887679221129850 for The (Mis)utilization of Cues During Deception Detection in 911 Homicide Calls by Patrick Markey, Erika Feeney, Brooke Berry, Alec Martin and Erica Slotter in Homicide Studies</p
Directed graph iterated function systems
No full textThis thesis concerns an active research area within fractal geometry.
In the first part, in Chapters 2 and 3, for directed graph iterated function systems
(IFSs) defined on ℝ, we prove that a class of 2-vertex directed graph IFSs have attractors
that cannot be the attractors of standard (1-vertex directed graph) IFSs, with
or without separation conditions. We also calculate their exact Hausdorff measure.
Thus we are able to identify a new class of attractors for which the exact Hausdorff
measure is known.
We give a constructive algorithm for calculating the set of gap lengths of any
attractor as a finite union of cosets of finitely generated semigroups of positive real
numbers. The generators of these semigroups are contracting similarity ratios of
simple cycles in the directed graph. The algorithm works for any IFS defined on ℝ
with no limit on the number of vertices in the directed graph, provided a separation
condition holds.
The second part, in Chapter 4, applies to directed graph IFSs defined on ℝⁿ . We
obtain an explicit calculable value for the power law behaviour as r → 0⁺ , of the qth
packing moment of μᵤ, the self-similar measure at a vertex u, for the non-lattice case,
with a corresponding limit for the lattice case. We do this
(i) for any q ∈ ℝ if the strong separation condition holds,
(ii) for q ≥ 0 if the weaker open set condition holds and a specified non-negative
matrix associated with the system is irreducible.
In the non-lattice case this enables the rate of convergence of the packing L[superscript(q)]-spectrum
of μᵤ to be determined. We also show, for (ii) but allowing q ∈ ℝ, that the upper
multifractal q box-dimension with respect to μᵤ, of the set consisting of all the intersections
of the components of Fᵤ, is strictly less than the multifractal q Hausdorff
dimension with respect to μᵤ of Fᵤ
