2019
DOI: 10.31614/cmes.2018.04240
|View full text |Cite
|
Sign up to set email alerts
|

Context-Based Intelligent Scheduling and Knowledge Push Algorithms for AR-Assist Communication Network Maintenance

Abstract: Maintenance is an important aspect in the lifecycle of communication network devices. Prevalent problems in the maintenance of communication networks include inconvenient data carrying and sub-optimal scheduling of work orders, which significantly restrict the efficiency of maintenance work. Moreover, most maintenance systems are still based on cloud architectures that slow down data transfer. With a focus on the completion time, quality, and load balancing of maintenance work, we propose in this paper a learn… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(5 citation statements)
references
References 21 publications
0
5
0
Order By: Relevance
“…The higher the frequency of term t i in a document, the stronger the document's ability to distinguish content attributes, and the greater its weight. The similarity between documents is expressed by the cosine of the included angle of the vector [24,26]. The similarity formula between document d i and document d j is…”
Section: 1mentioning
confidence: 99%
“…The higher the frequency of term t i in a document, the stronger the document's ability to distinguish content attributes, and the greater its weight. The similarity between documents is expressed by the cosine of the included angle of the vector [24,26]. The similarity formula between document d i and document d j is…”
Section: 1mentioning
confidence: 99%
“…where k = ðW, E, R, TÞ and a is a (local) initial allocation of k , which is the maximum compatible allocation [22]. The initial distribution and k are measured, and the sum of the penalty perturbation changes occurs.…”
Section: Application Of Minimum Disturbance and Optimalmentioning
confidence: 99%
“…AGVs can become idle when they finish their current tasks, and the goal nodes of previous tasks are often not the start nodes of the following tasks. Common principles of AGVs scheduling are as follows [62,63] The scheduling method in warehouses includes: (a) offline AGVs scheduling; (b) online AGVs scheduling, and the methods can be classified into the following categories [64]: (a) First-Come-First-Served (FCFS), which is one of the most widely used methods, and the operation orders entirely depend on the issued time of tasks; (b) greedy method, which is used to minimize operation cost; (c) task priority-based method, the objective of the method is to deliver emergent goods (e.g., fresh foods) to customers as soon as possible.…”
Section: Automated Guided Vehicles Scheduling In Warehousesmentioning
confidence: 99%