Search Results - (( developing e ((sensor algorithm) OR (path algorithm)) ) OR ( java implication based algorithm ))
Search alternatives:
- implication based »
- sensor algorithm »
- java implication »
- path algorithm »
- developing e »
-
1
-
2
Improved tree routing protocol in zigbee networks
Published 2010“…ImpTR protocol uses an approach to select next hope depending on new algorithm and uses the same tree topology construction for distributing address to all sensor nodes in the network. …”
Get full text
Get full text
Thesis -
3
-
4
-
5
Obstacle detection for Unmanned Aerial Vehicle (UAV)
Published 2022Get full text
Get full text
Get full text
Article -
6
Robotics in Education
Published 2026“…The AI section discusses machine learning, path-planning algorithms (e.g., A* search, SLAM), and classroom case studies. …”
Get full text
Get full text
Get full text
Get full text
Book -
7
Development of a prototype solar-powered autonomous vehicle prototype with object detection and avoidance system using Raspberry-Pi
Published 2024“…Autonomous vehicles (AVs)offer a degree of self-control in driving in which a normal car requires a driver to execute such tasks e.g., braking, acceleration, and steering. An autonomous vehicle, requires sensors, controllers, algorithms, actuators, computers, and advanced software embedded in various locations on the vehicle to perform effectively. …”
Get full text
Get full text
Get full text
Article -
8
Investigating and developing the best method in shortest path for implementing a geographical information system (e-map) for Peninsular Malaysia
Published 2005“…A development of GIS database is also involved in prototype covering the road network in Peninsular Malaysia (the e-map) will be developed to show the viability or validity of the findings. …”
Get full text
Get full text
Monograph -
9
Safe avoidance region detection for unmanned aerial vehicle using cues from expansion of feature points
Published 2024Get full text
Get full text
Conference or Workshop Item -
10
A testbed for device free indoor localization system
Published 2016“…This paper elaborates on the development of a wireless network test-bed to measure the Received Signal Strength Indicator (RSSI) in different environments, as the first step for the application of fingerprinting-type localization algorithms of wireless LAN devices. …”
Get full text
Get full text
Conference or Workshop Item -
11
A testbed for device free indoor localization system
Published 2016“…This paper elaborates on the development of a wireless network test-bed to measure the Received Signal Strength Indicator (RSSI) in different environments, as the first step for the application of fingerprinting-type localization algorithms of wireless LAN devices. …”
Get full text
Get full text
Conference or Workshop Item -
12
-
13
Meta-Heuristic Algorithms for Learning Path Recommender at MOOC
Published 2021“…We have developed Metaheuristic algorithms includes the Genetic Algorithm (GA) and Ant Colony Optimization Algorithm (ACO), to solve the proposed model. …”
Get full text
Get full text
Article -
14
Cyclic Path Planning Of Hyper-Redundant Manipulator Using Whale Optimization Algorithm
Published 2023Article -
15
-
16
-
17
Development of Path Loss Models for Smooth and Convex Surfaces Terrains in Malaysian Environment
Published 2004“…This study describes the development of path loss prediction model for smooth and convex surfaces terrains in Malaysian environment. …”
Get full text
Get full text
Thesis -
18
Resource-Efficient Coverage Path Planning for UAV-Based Aerial IoT Gateway
Published 2023“…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
Article -
19
Computationally-efficient path planning algorithms in obstacle-rich environments based on visibility graph method
Published 2018“…Cun·ent studies have been focused on developing path planning algorithms to satisfy the criteria of path planning namely minimum path length, low computation time and complete, i.e., it gives positive result if a path is available or negative if otherwise. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
20
