Search Results - (( using set path algorithm ) OR ( using optimization ((method algorithm) OR (sensor algorithm)) ))
Search alternatives:
- method algorithm »
- sensor algorithm »
- path algorithm »
- using set »
- set path »
-
1
Modelling of multi-robot system for search and rescue
Published 2023“…Moreover, to cope with dynamic environments, a combination of global and local path planning methods is introduced. The PSO algorithm functions as a global path planner, determining the complete path for each robot, whereas a sensor-based obstacle avoidance algorithm serves as a local planner to avoid collision with dynamic obstacles during navigation. …”
Get full text
Get full text
Final Year Project / Dissertation / Thesis -
2
A new routing mechanism for energy-efficient in bluetooth mesh-low power nodes based on wireless sensor network
Published 2023“…The multi-criterion energyefficient routing mechanism uses the ACO algorithm, inspired by ants' foraging behaviour. …”
Get full text
Get full text
Get full text
Thesis -
3
Using artificial intelligence search in solving the camera placement problem
Published 2022“…In order to solve the camera placement problem, a crucial fundamental step is modeling the coverage of the cameras in use. Following the coverage modeling, an optimization method needs to be used to locate the optimal poses and/or camera positions. …”
Get full text
Get full text
Book -
4
A generalized laser simulator algorithm for optimal path planning in constraints environment
Published 2022“…A statistical test was used to demonstrate the efficiency of the proposed algorithm over the compared methods. …”
Get full text
Thesis -
5
Modeling and control of a Pico-satellite attitude using Fuzzy Logic Controller
Published 2010“…In this regards, a new method of Pico-satellite attitude control using Mamdani Fuzzy Logic Principles is introduced. …”
Get full text
Thesis -
6
Predetermined path of mobile data gathering in wireless sensor networks based on network layout
Published 2014“…There are two prevailing strategies used to collect data in sensor networks. The first approach requires data packets to be serviced via multi-hop relay to reach the respective base station (BS). …”
Get full text
Get full text
Article -
7
Dynamic area coverage algorithms for static and mobile wireless sensor network environments using voronoi techniques
Published 2011“…The proposed Voronoi Tessellation-based Coverage Optimization Algorithms for Static and Mobile Wireless Sensor Networks provides up to 99% coverage at various number of mobile-static sensor node combination and up to 12% reduction in average moving distance. …”
Get full text
Get full text
Thesis -
8
A Feasible Architecture Of Real-Time Collision Avoidance And Path Planning For Semi-Autonomous Unmanned Ground Vehicle (Ugv)
Published 2018“…Meanwhile, an Arduino Mega 2560 and ArduPilot Mega 2.6 (APM) are used as microcontrollers for obstacle avoidance and path optimization purpose respectively. …”
Get full text
Get full text
Monograph -
9
Systematic design of chemical reactors with multiple stages via multi-objective optimization approach
Published 2015“…Specifically, multi-objective optimization method will be used to generate Pareto optimal solutions that characterize the non-inferior solutions set for the problem. …”
Get full text
Get full text
Conference or Workshop Item -
10
A Novel Polytope Algorithm based on Nelder-mead method for localization in wireless sensor network
Published 2024“…Methods: It is suggested that the objective function that will be optimized using NMM is the mean squared error of the range of all neighboring anchor nodes installed in the studied WSNs. …”
Get full text
Get full text
Get full text
Get full text
Article -
11
A centralized localization algorithm for prolonging the lifetime of wireless sensor networks using particle swarm optimization in the existence of obstacles
Published 2017“…Particle Swarm Optimization has been used in the proposed algorithm to minimize the fitness function. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
12
Simulated Kalman Filter optimization algorithm for maximization of wireless sensor networks coverage
Published 2019“…Simulated Kalman Filter (SKF) is a population based optimization algorithm inspired by the Kalman filtering method. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
13
Optimization of fast fourier transform processor using genetic algorithm on Raspberry Pi
Published 2019“…Over the years the Genetic Algorithms (GA) proved to be one of the best methods for optimization. …”
Get full text
Get full text
Get full text
Article -
14
Global optimization method for continuous - Time sensor scheduling
Published 2010“…We consider a situation in which several sensors are used to collect data for signal processing since operating multiple sensors simultaneously canses system interference, only one sensor can be active at any one time.The problem of scheduling a discrete-valued optimal control problem.This problem cannot be solved using conventional optimization problem.The Transformed problem is then decomposed into a bi-level optimization problem, which is solved using a discreate filled function method in conjunction with a conventional optimal control algorithm.Numerical results show that our algorithm is robust, efficient, and reliable in attaining a near globally optimal solution.…”
Get full text
Get full text
Get full text
Article -
15
The Multi-Objective Optimization Algorithm Based on Sperm Fertilization Procedure (MOSFP) Method for Solving Wireless Sensor Networks Optimization Problems in Smart Grid Applicatio...
Published 2018“…Our proposed method, named Multi-Objective Optimization Algorithm Based on Sperm Fertilization Procedure (MOSFP), along with other three state-of-The-Art multi-objective optimization algorithms known as OMOPSO, NSGA-II and SPEA2, are utilized in this study. …”
Get full text
Get full text
Article -
16
Metaheuristic optimization techniques for localization in outdoor wireless sensor networks: a comprehensive review
Published 2025“…This paper serves as a comprehensive background on localization algorithms and methods used in wireless sensor networks, offering insights for researchers to develop efficient localization algorithms tailored to specific application requirements in diverse work environments.…”
Get full text
Get full text
Get full text
Get full text
Article -
17
Hybrid genetic algorithm with multi-parents recombination for job shop scheduling problems / Ong Chung Sin
Published 2013“…This mechanism is restricted to search the possible solutions in a critical path. Modification on the path by using neighborhood search significantly reduces the total length of the makespan. …”
Get full text
Get full text
Get full text
Thesis -
18
A hybrid multi-objective optimisation for energy efficiency and better coverage in underwater wireless sensor networks / Salmah Fattah
Published 2022“…The results obtained are then analysed to assess the proposed solution’s performance in obtaining each deployment objective’s optimal value. Finally, the proposed algorithm’s effectiveness regarding node coverage, energy consumption, Pareto-optimal value, and algorithm execution time is validated using three Pareto-optimal metrics: including inverted generation distance (IGD), hypervolume, and diversity. …”
Get full text
Get full text
Get full text
Thesis -
19
A hybrid multi-objective optimisation for energy efficiency and better coverage in underwater wireless sensor networks
Published 2022“…The results obtained are then analysed to assess the proposed solution's performance in obtaining each deployment objective's optimal value. Finally, the proposed algorithm's effectiveness regarding node coverage, energy consumption, Pareto-optimal value, and algorithm execution time is validated using three Pareto-optimal metrics: including inverted generation distance (IGD), hypervolume, and diversity. …”
Get full text
Get full text
Get full text
Thesis -
20
Delay and energy-aware routing for efficient data collection in wireless sensor networks / Ihsan Ali
Published 2024“…The AFW algorithm reduces unnecessary computations by focusing only on useful edge entries in the graph, thereby expediting the optimization process. …”
Get full text
Get full text
Get full text
Thesis
