Multi-user reservation scheduling route planning method and relevant device

A technology for scheduling paths and path planning, which is applied in the computer field and can solve problems such as the difficulty of total path planning and the difficulty of calculation.

Active Publication Date: 2018-06-01
GUANGDONG UNIV OF TECH
View PDF3 Cites 5 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

This kind of problem is based on the pure multi-person path planning problem, which limits the time period limit of the visiting target and requires sufficient matching between the visitor and the visited in some aspects.
Under the new constrain

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Multi-user reservation scheduling route planning method and relevant device
  • Multi-user reservation scheduling route planning method and relevant device
  • Multi-user reservation scheduling route planning method and relevant device

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0048] With the improvement of computer computing power, the problems that can be solved according to the algorithm become more and more complex, and on the other hand, the problems that can be solved are getting closer and closer to real problems. Among them, in reality, path planning not only requires how the actor arrives at the destination, but also needs to consider when the actor arrives. In the case of multiple actors and multiple destinations, whether the destination reached by the actor is Matching destinations, therefore, the problem of multi-person reservation scheduling path planning is derived. Because it adds new constraints and new variables based on the basic path planning problem, the original path planning problem is no longer applicable to this type of problem.

[0049] To this end, this application provides a multi-person reservation scheduling path planning method, a multi-person reservation scheduling path planning device, a computer and a computer-readab...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The application discloses a multi-user reservation scheduling route planning method which comprises the following steps: constructing a time window variable according to a time limit that an access toa destination is allowed in route planning; constructing a matching degree variable according to a matching degree of each actor in the route planning and the destination; adding the time window variable and the matching degree variable into an ant colony algorithm, so as to obtain a multi-user reservation scheduling ant colony algorithm; planning a route by adopting the multi-user reservation scheduling ant colony algorithm. A variant of the ant colony algorithm is obtained by adding the time window variable and the matching degree variable into the original ant colony algorithm according tothe multi-user reservation scheduling route planning, a scheduled route of each actor can be obtained under the condition of multi-user reservation scheduling by adding parameter data in calculation,and the problem of multi-user reservation scheduling route planning is solved. The application also discloses a multi-user reservation scheduling route planning device, a computer and a computer readable storage medium which have the beneficial effects.

Description

technical field [0001] The present application relates to the field of computer technology, and in particular to a multi-person reservation scheduling route planning method, a multi-person reservation scheduling route planning device, a computer, and a computer-readable storage medium. Background technique [0002] With the development of computing power of computers, solutions of realistic planning problems can also be calculated in computers according to different algorithms. Among them, the most widely used is in solving path planning problems. Human resources can be allocated efficiently through computers and corresponding planning algorithms, and with the enhancement of computer performance, the allocation speed is getting faster and faster. Algorithms currently applied to such problems include ant colony algorithm, particle swarm algorithm, tabu algorithm, genetic algorithm, simulated annealing algorithm, etc. [0003] In the continuous application of computer-aided p...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): G01C21/34
CPCG01C21/3446
Inventor 张婷杨欣潼白丽平陈文戈毛宁
Owner GUANGDONG UNIV OF TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap