Method for optimizing and solving intelligent unmanned vehicle path planning problem based on multi-constraint correction C-W algorithm

A route planning, C-W technology, applied in the field of logistics and delivery, can solve problems such as weight limit and different types of vehicles

Pending Publication Date: 2021-01-05
XIANGTAN UNIV
View PDF0 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] The purpose of the present invention is to solve the problems caused by weight limit, time window and different types of vehicles in the delivery of u

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
  • Method for optimizing and solving intelligent unmanned vehicle path planning problem based on multi-constraint correction C-W algorithm
  • Method for optimizing and solving intelligent unmanned vehicle path planning problem based on multi-constraint correction C-W algorithm
  • Method for optimizing and solving intelligent unmanned vehicle path planning problem based on multi-constraint correction C-W algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0076] The following will clearly and completely describe the technical solutions in the embodiments of the present invention with reference to the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are only some, not all, embodiments of the present invention. Based on the embodiments of the present invention, all other embodiments obtained by persons of ordinary skill in the art without making creative efforts belong to the protection scope of the present invention.

[0077] see Figure 1-4 , the present invention provides a technical solution:

[0078] Step 1: According to the actual problem model, describe and build a model for the actual problem.

[0079] Step 2: On the basis of the C-W saving algorithm, add weight limit and time window constraints to modify and optimize the C-W algorithm, and try to solve the actual path optimization with the optimization algorithm under the two constraints.

[0080] Step 3: Add const...

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 invention discloses a method for optimizing and solving an intelligent unmanned vehicle path planning problem based on a multi-constraint correction CW algorithm. According to the method, a simpleCW algorithm is modified, different constraint conditions such as weight limit, time windows and vehicle types are added to existing path optimization, and an intelligent unmanned vehicle delivery route is planned. According to the method, firstly, modeling is carried out on actual problems, then a corrected CW algorithm is used for solving the constraint problems of weight limitation and a timewindow in delivery route planning, and then different processing is carried out on planned routes according to different transport task optimization types, so that an optimal unmanned vehicle deliveryscheme is found.

Description

technical field [0001] The invention relates to the field of logistics delivery, in particular to a method for optimizing and solving the path planning problem of an intelligent unmanned vehicle based on a multi-constraint modified C-W algorithm. Background technique [0002] The vehicle scheduling problem is a very important problem in logistics management. It usually refers to that under certain constraints, the enterprise distributes certain vehicles and organizes appropriate driving routes to deliver goods to customers, and strives to achieve certain goals. For example, transportation distance, cost minimization. The problem that only considers space but not time in distribution is called vehicle routing problem (Vehicle routing Problem, referred to as VRP). When there is a time window constraint in delivery, such a problem is called Vehicle Scheduling Problem (VSP). VSP is widely used in large-scale manufacturing and assembly, steel, logistics and transportation, and ...

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): G06Q10/04G06Q10/08G06N3/12
CPCG06Q10/047G06Q10/083G06N3/126
Inventor 邹娟王求真林瑞全杨源彭祯源申显辉
Owner XIANGTAN UNIV
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