跳到主要导航
跳到搜索
跳到主要内容
北京理工大学 首页
English
中文
首页
师资队伍
研究单位
科研成果
奖项
按专业知识、名称或附属进行搜索
A branch-and-bound approach for path planning of vehicles under navigation relayed by multiple stations
Mingfeng Qi, Lihua Dou,
Bin Xin
*
, Jie Chen
*
此作品的通讯作者
自动化学院
Beijing Institute of Technology
科研成果
:
书/报告/会议事项章节
›
会议稿件
›
同行评审
1
引用 (Scopus)
综述
指纹
指纹
探究 'A branch-and-bound approach for path planning of vehicles under navigation relayed by multiple stations' 的科研主题。它们共同构成独一无二的指纹。
分类
加权
按字母排序
Computer Science
Bound Approach
100%
Branch-and-Bound Algorithm Design
100%
Combinatorial Optimization Problem
25%
Computational Cost
25%
Constrained Optimization
50%
Continuous Variable
25%
Decision Trees
25%
Differential Evolution
25%
Optimization Problem
50%
path planning problem
25%
path-planning
100%
Engineering
Computational Cost
50%
Constrained Optimization Problem
100%
Continuous Variable
50%
Optimal Path
50%
Optimisation Problem
50%
Path Planning
100%
Chemical Engineering
Constrained Optimization
100%
Motion Planning
100%
Mathematics
Exhaustive Enumeration
100%