6篇
您的检索式：作者名="MATTHEW Cartmell"
|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | 一种改进的RM可调度性判定算法显示文摘固定优先级任务可调度性判定是实时系统调度理论研究的核心问题之一.目前已有的各种判定方法可归结为两大类:多项式时间调度判定和确切性判定.多项式时间调度判定通常采用调度充分条件来进行,为此,许多理想条件下基于RM(rate monotonic)调度算法的CPU利用率最小上界被提了出来.确切性判定利用RM调度的充要条件,保证任何任务集均可被判定,并且判定结果是确切的.但是由于时间复杂度较差,确切性判定方法难以实现在线分析.提出了一种改进的RM可调度性判定方法(improved schedulability test algorithm,简称ISTA).首先介绍了任务调度空间这一概念,并提出了二叉树表示,然后进一步提出了相关的剪枝理论.在此基础上,研究了任务之间可调度性的相关性及其对判定任务集可调度性的影响,提出并证明了相关的定理.最后基于提出的定理,给出了一种改进的伪多项式时间可调度性判定算法,并与已有的判定方法进行了比较.仿真结果表明,该算法平均性能作为任务集内任务个数的函数具有显著提高. | 刘军祥 王永吉 Matthew Cartmell | 2005 | 软件学报2005，16，1： | 16 |
| 2 | A Generalized Real-Time Obstacle Avoidance Method Without the Cspace Calculation显示文摘An important concept proposed in the early stage of robot path planning field is the shrinking of a robot to a point and meanwhile the expanding of obstacles in the workspace as a set of new obstacles. The resulting grown obstacles are called the Configuration Space (Cspace) obstacles. The find-path problem is then transformed into that of finding a collision-free path for a point robot among the Cspace obstacles. However, the research experiences have shown that the Cspace transformation is very hard when the following situations occur: 1) both the robot and obstacles are not polygons, and 2) the robot is allowed to rotate. This situation gets even worse when the robot and obstacles are three dimensional (3D) objects with various shapes.For this reason, direct path planning approaches without the Cspace transformation is quite useful and expected. Motivated by the practical requirements of robot path planning, a generalized constrained optimization problem (GCOP) with not only logic AND but also logic OR relationships was proposed and a mathematical solution developed previously. This paper inherits the fundamental ideas of inequality and optimization techniques from the previous work, converts the obstacle avoidance problem into a semi-infinite constrained optimization problem with the help of the mathematical transformation, and proposes a direct path planning approach without Cspace calculation, which is quite different from traditional methods. To show its merits,simulation results in 3D space have been presented. | 王永吉 Matthew Cartmell 陶秋铭 刘晗 | 2005 | Journal of Computer Science & Technology2005，20，6： | 1 |
| 3 | Investigating the use of motorized tethers for payload orbital transfer 显示文摘 | Ziegler Spencer W Cartmell Matthew P | 2000 | AIAA2000，4529，： | 1 |
| 4 | Wave propagation in delaminated beam显示文摘 | Wieslaw Ostachowicz Marek Krawczuk Matthew Cartmell | 2004 | Computers and Structures2004，82，： | 1 |
| 5 | A novel multiple blade ultrasonic cutting device显示文摘 | ANDREA Cardoni MARGARET Lucas MATTHEW Cartmell | 2004 | Ultrasonic2004，42，： | 1 |
| 6 | Wave propagation in delaminated beam显示文摘 | Wies law Ostachowiez Marek Krawezuk Matthew Cartmell | 2004 | Computers and Structures2004，82，： | 1 |
您所在的机构暂未开通此部分的功能，请联系管理员