Illumination communication dynamic routing ant colony algorithm based on new probability transfer function
A probabilistic transfer and lighting communication technology, applied in the field of dynamic path-finding ant colony algorithm for lighting communication, can solve the problems of not having the ability to dynamically adapt to changes in the power line environment and slow algorithm convergence
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0041] Example 1: Applying the ant colony algorithm to the transmission line network, the source node is a centralized controller, and the destination node is a certain street lamp control node. The source node and the destination node are respectively regarded as "ant nest" and "food", and the data Packets are regarded as ants, and the pheromones left on the route are replaced by routing tables, and the pheromone concentrations in the tables are expressed in the form of probability values. A routing table is maintained by routing nodes, and ants choose paths according to the amount of pheromone, which is essentially consistent. Ants update the pheromone table at certain intervals. The path to be taken in the next step is selected through the pheromone table, that is, the node transition probability table. After multiple iterations, finding the route with the highest pheromone that satisfies the constraints is the solution sought. In the ant algorithm of pheromone, the pherom...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com