Search Results - (( using factor path algorithm ) OR ( basic selection path algorithm ))

Integration of enchanced jump point search (JPS) algorithm with modified bresenham technique for path planning in virtual grid-based environment by Nurul Atikah Janis

“…Jump Point Search is one of the path finding algorithm with huge advantage of maintaining zero memory overhead as no preprocessing process involved. …”
Get full text
Get full text
Get full text

Scheduling of batch process plant / Abdul Aziz Abu Bakar by Abu Bakar, Abdul Aziz

“…This research work is devoted to software development of scheduling and control algorithm of batch process plant using shortest path method developed by Dijkstra and K* shortest path method developed by Jin Y. …”
Get full text
Get full text

A-star (A*) algorithm implementation for robotics path planning navigation by Emirul Ridzwan, Nor Azmi

“…This thesis is about the implementation of Astar (A*) algorithm as path planning algorithm used in robotics navigation. …”
Get full text
Get full text

Robotic indoor path planning using dijkstra's algorithm with multi-layer dictionaries by Fadzli, S.A., Abdulkadir, S.I., Makhtar, M., Jamal, A.A.

“…The path computed using the classic Dijkstra's algorithm is the shortest; however, it may not be the most feasible. …”
Get full text
Get full text

New algorithm for autonomous dynamic path planning in real-time intelligent robot car by Mohammed, Akeel Ahmed, Hassan, Mohd Khair, Aris, Ishak, Kamsani, Noor Ain

“…Different algorithms have been used to address this problem by considering the optimal path with minimum cost; however, these algorithms did not consider the execution time to find such path. …”
Get full text
Get full text
Get full text

Cognitive map approach for mobility path optimization using multiple objectives genetic algorithm by Krishnan P.S., Paw J.K.S., Kiong T.S.

A Continuous Overlay Path Probing Algorithm For Overlay Networks by Feily, Maryam

“…Several experiments were carried out using the OMNeT++ simulation framework. The designed algorithm was evaluated using experimental data. …”
Get full text
Get full text

Nlfxlms and thf-nlfxlms algorithms for wiener-hammerstein nonlinear active noise control by Srazhidinov, Radik

“…However, this assumption may lead to inaccurate secondary path model. In this work, the modelling of acoustic path using FIR filters is incorporated for both algorithms for Wiener-Hammerstein structure. …”
Get full text
Get full text

Network analysis for GPS UTMnav system: preliminary stage by A. Majid, Siti Nuruljannah, Musa, Tajul Ariffin, Setan, Halim, Musliman, Ivin Amri

“…Each algorithm was reviewed and a simulation test was conducted to evaluate the selected algorithms. …”
Get full text
Get full text
Get full text

IMPLEMENTATION OF BEHAVIOUR BASED NAVIGATION IN A PHYSICALLY CONFINED SITE by ABDUL RAZAK, NUSRAH

“…Selected basic behaviour-based algorithms such as wallfollower, obstacle avoidance, escape route and target detection are to be combined and its efficiency is measured. …”
Get full text
Get full text

A Novel Path Prediction Strategy for Tracking Intelligent Travelers by Motlagh, Omid Reza Esmaeili

“…The FCM nodes are a novel selection of kinematical factors. Genetic algorithm (GA) is then used to train the FCM to be able to replicate the decisional behaviors of the intelligent traveler. …”
Get full text
Get full text

Enhancing performance of global path planning for mobile robot through Alpha–Beta Guided Particle Swarm Optimization (ABGPSO) algorithm by Ahmad, Javed, Ab Wahab, Mohd Nadhir, Ramli, Ahmad, Misro, Md Yushalify, Ezza, Wan Zafira, Wan Hasan, Wan Zuha

“…Experiments were carried out in four different layouts related to path-planning environments, and comparisons were made with various existing path-planning algorithms. …”
Get full text
Get full text
Get full text

Indoor navigation system using Dijkstra’s algorithm for emergency situation: article / Mohd Faizulhayad Mashuri by Mashuri, Mohd Faizulhayad

“…Route planning using Dijkstra’s algorithm can produce better accuracy and more reliable in indoor environment since the only factor taken into account is the weight for each path.…”
Get full text
Get full text

Resource-Efficient Coverage Path Planning for UAV-Based Aerial IoT Gateway by Nurul Saliha A. Ibrahim, Nurul Saliha A. Ibrahim, Faiz A. Saparudin, Faiz A. Saparudin

“…The EECPP is composed of two algorithms: the Stop Point Prediction Algorithm using K-Means, and Path Planning Algorithm using Particle Swarm Optimization. …”
Get full text
Get full text
Get full text

Path planning for autonomous navigation in roundabouts using an improved triangular based polynomial estimation technique for bezier curve generation with aa and aa* algorithms by Sajith Akhil, Vinayak

Get full text
Get full text

Reducing Iteration Using Candidate List by Md Rais, Helmi, Ali Othman, Zulaiha, Hamdan, Abdul Razak

“…The principle of cooperation and the behavior of a single ant finding path has been the backbone in this algorithmic development. …”
Get full text
Get full text

Range sensor based local path planning algorithm for mobile robot in unknown static environment with beacon / Wan Ahmad Jailani Wan Ngah by Wan Ngah, Wan Ahmad Jailani

“…PointsBug is then compared with TangentBug because it is the best among The Bug Algorithm family using the range sensor for distance, duration, speed and reachability.…”
Get full text
Get full text

Associated Factors of Cardiovascular Diseases in Pakistan: Assessment of Path Analyses Using Warp Partial Least Squares Estimation by Mirza Rizwan, Sajid, Noryanti, Muhammad, Roslinazairimah, Zakaria, Shahbaz, Ahmad, Nauman, Ahmad

“…The information on demographic, SE, modifiable and clinical factors of CVDs was recorded. Warp partial least squares (PLS) based on warp 3 algorithm was used to estimate the simultaneous linear and non-linear path coefficients of the proposed model of study. …”
Get full text
Get full text
Get full text

Providing wireless coverage in massively crowded events using UAVs by Sawalmeh A., Othman N.S., Shakhatreh H., Khreishah A.

Heuristic factors in ant system algorithm for course timetabling problem by Djamarus, Djasli, Ku-Mahamud, Ku Ruhana

“…This paper presents an algorithm that is based on ant system to solve the course timetabling problem.The problem is modeled using the bipartite graph.Four heuristic factors are derived from the graph characteristic, are used to direct ants as the agent in finding course timetable elements The concept of negative pheromone was also applied to ensure that paths leading to dead ends are not chosen.The performance of this proposed algorithm is promising when comparison of performance was made with the original ant system algorithm. …”
Get full text
Get full text