Search

Objective: To study the feasibility and potential benefits of beam angle optimization (BAO) to automated planning in liver cancer., Methods: An approach of beam angle sampling is proposed to implement BAO along with the module Auto-planning in treatment planning system (TPS) Pinnacle. An in-house developed plan quality metric (PQM) is taken as the preferred evaluating method during the sampling. The process is driven automatically by in-house made Pinnacle scripts both in sampling and scoring. In addition, dosimetry analysis and physician's opinion are also performed as the supplementary and compared with the result of PQM., Results: It is revealed by the numerical analysis of PQM scores that only 15% patients whose superior trials evaluated by PQM are also the initial trials. Gantry optimization can bring benefit to plan quality along with auto-planning in liver cancer. Similar results are provided by both dose comparison and physician's opinion., Conclusions: It is possible to introduce a full automated approach of beam angle optimization to automated planning process. The advantages of this procedure can be observed both in numerical analysis and physician's opinion.

Copyright of Automobile Technology & Material is the property of Automobile Technology & Material Editorial Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Application Research of Computers / Jisuanji Yingyong Yanjiu is the property of Application Research of Computers Edition and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Increased number of Automated Guided Vehicles (AGVs) on automated container terminals leads to more frequent conflicts. This paper proposed an improved Conflict Based Search (CBS) algorithm. The bottom layer used the A* algorithm based on Manhattan distance, and the top layer combined the binary tree principle to build conflict trees to avoid conflicts between AGVs. With the objective of minimizing the total path length of AGVs between the shore bridge and the yard, the grid method used to developed the AGVs road network mode. Considering the point conflict and edge conflict among AGVs, the multi-AGVs conflict-free path planning problem in automated terminals statuted as a multi-agent path planning problem. The experimental results show that the proposed algorithm shortens the total path length and increases the computational speed with a guaranteed blockage rate of 0%, which verifies the effectiveness of the algorithm. [ABSTRACT FROM AUTHOR]

Automated planning was proposed for military system-of-systems vulnerability analysis. Goal, capability, state and action were used as the conceptual framework for military system-of-systems description. Vulnerability analysis was reduced to problems concerning goal reachability and every-possible plan generation. A modification was made to the search strategy of graph planning algorithm. In the new algorithm, search in and/or graph is transformed to depth-first search in a tree with goals and actions as its nodes. The algorithm is capable of generating a complete set of courses of action in the sense of expelling aI1 redundancy actions. Correctness and completeness of the algorithm were proved. The algorithm is efficient when both the number of actions and the number of preconditions of actions are small. An analysis example shows that this method is feasible for system-of-systems vulnerability analysis. But further research should be conducted to limit search space of large scale problems by applying additional constraints. [ABSTRACT FROM AUTHOR]

The path planning of automated guided vehicle (AGV) affects the efficient and smooth production in a flexible manufacturing workshop. This paper analyzed the common conflict types of multiple AGV performing transport tasks in the workshop, and then proposed a multi-AGV conflict-free path planning method based on dynamic priority strategy. This method detected the specific conflict types by time window, and considered the waiting time, the distance traveled and task urgency as the factors to quantitatively evaluate the dynamic priority, which was then utilized as the selection basis of two conflict reduction methods,i. e.,waiting and quadratic path planning. The case study indicates that when the feasible paths of each AGV are known in advance, the proposed method cannot only realize the multi-AGV conflict-free path planning, but also improve the overall efficiency of multiple AGV in completing transport tasks. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Guangdong University of Technology is the property of Journal of Guangdong University of Technology and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Computer Engineering & Applications is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Given a specific domain and problem, automated planning will generate plan solutions composed of applicable actions. In classic planning, actions have deterministic effects and are carried out sequentially. However, in real-world problems, the effects of an action might be non-deterministic and there might be concurrent actions. Therefore, the parallel and probabilistic planning(PPP) was proposed. The PPP has a strong application perspective and is drawing a great deal of attention in the planning community. Therefore, this paper presented a survey on the PPP. It first gave formal definitions of domains, problems and plan solutions of the PPP. Then it introduced competition languages, benchmark domains and competitive planners in the PPP. Finally, it tested two representative planners. Experiment results show that, for the efficiency, the results were similar to those in the competitions. However, the scalability was different. It might be caused by some unpublished source codes or some manual intervention. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Computer Engineering & Applications is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Beijing University of Technology is the property of Journal of Beijing University of Technology, Editorial Department and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

In the noisy intermediate-scale quantum (NISQ) era, traditional initial mapping strategies overlook potential adjacency issues in subsequent operations. To address this challenge, a multi- factor interaction cost function is devised, considering the distance between qubits, the interaction time, and the gate operations error rate. Additionally, the comprehensive SWAP optimization strategy (CSOS) is proposed to address the adjacency problem in quantum circuits, including the optimal SWAP selection and the SWAP- based batch update strategy (BUS) to optimize the local qubit mapping in quantum circuits. Optimal SWAP selection involves SWAP operations choices with the highest benefit by comparing advantages. The BUS considers upcoming quantum operation sequences during the mapping phase and proactively performs SWAP operations batches. These approaches reduce the SWAP operation numbers during the entire circuit execution process, minimizing mapping overhead to the greatest extent. Experimental results demonstrate that the CSOS reduce the average number of inserted SWAP gates by 38.1% and lower hardware gate count expenses by approximately 12%. [ABSTRACT FROM AUTHOR]

Sarez Lake is the largest plateau barrier lake in the world so far. Once the barrier body breaks, it will cause huge flood disasters to the five Central Asian countries. Many studies have focused on the resolution of the security risks on the side of the westward barrier body, and there is a complex terrain., There are many technical difficulties such as large water level drop and large potential disaster area. Therefore, from the perspectives of distance, elevation difference, and rational use of water resources, innovative ideas for feasibility analysis of eastward water diversion are proposed. Based on hydrological and spatial analysis methods, combined with terrain metrics, and using Dijkstra algorithm ideas, a spatial optimization route selection model is constructed, and a technical method for automated planning of the lowest cost route of the eastward direction of Lake Salez is proposed, and alternative routes are derived. Finally, it analyzes the advantages, disadvantages and feasibility of the alternative schemes for introducing the lake into Xinjiang from the perspective of engineering quantity, safety and ecology. The research results provide innovative ideas and technical references for scientifically resolving the risk of the world's largest plateau dammed lake breakout while rationally using water resources to alleviate the water shortage problem in Kashgar, Xinjiang. [ABSTRACT FROM AUTHOR]

Copyright of Chinese Medical Equipment Journal is the property of Chinese Medical Equipment Journal Editorial Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

This study addresses the issue of slow speed and low efficiency in path planning algorithms for multiagents on a plane. We formulate the multi-agent path planning problem as a non-zero-sum stochastic game and employ the multi-agent reinforcement learning algorithm, win or learn fast - policy hill-climbing (WoLF-PHC), to obtain a Nash equilibrium strategy to make conflict free optimal path decisions for each agent. Additionally, we propose a fast adaptive WoLF-PHC (FA-WoLF-PHC) algorithm to improve the WoLF-PHC algorithm by constructing an objective function and using gradient descent method to adaptively update the learning rate. FA-WoLF-PHC applied in two game scenarios: coin flipping and custom payoff matrix, and compared with policy hill-climbing (PHC) and WoLF-PHC algorithms. The experimental data show that the FA-WoLF-PHC algorithm improves the learning speed compared to the WoLF-PHC and effectively reduces oscillations in the learning process of WoLF-PHC and PHC algorithms. In the multi-agent path planning problems, the FA-WoLF-PHC algorithm improves the learning speed by 16. 01% compared to WoLF-PHC algorithm. When the environmental grid map is expanded to 6 x 6 and the number of agents is increased to 3, the average times required for the FA-WoLF-PHC, WoLF-PSP and PP-AP Sarsa (Physarum Polycephalum-Artificial Potential Sarsa) algorithms are 16. 30, 20. 59, and 17. 72 seconds, respectively, to learn the final strategies over 10 experiments. The results show that the FA-WoLF-PHC algorithm can obtain Nash equilibrium strategies for each agent, and it effectively improves learning speed compared to the WoLF-PSP and PP-AP Sarsa algorithms. The FA-WoLF-PHC algorithm can quickly learn Nash strategies in common game scenarios and generate conflict-free optimal paths for each agent in multi-agent path planning problems, showing significant improvement in learning speed compared with other algorithms. [ABSTRACT FROM AUTHOR]

Path planning is one of the key technologies for robot navigation. An excellent path planning algorithm can quickly find the best collision-free path and improve operational efficiency. Most existing classification methods have difficulty in expressing the differences and connections between algorithms. To distinguish different path planning algorithms more clearly, they are divided into graph-based search, bionic-based, potential field-based, velocity space-based and sampling-based algorithms based on their principle and nature. This paper introduces the concept, characteristics, and development status of each type of algorithm, analyzes the more widely used sample-based algorithms from the perspective of single-query and multi-query algorithms, and the advantages and problems of different types of path planning algorithms are compared and summarized. Finally, the future development trend of robot path planning algorithms in terms of multi-robot collaboration, multi-algorithm fusion and adaptive planning is prospected. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Computer Engineering & Applications is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Chinese Journal of Network & Information Security is the property of Beijing Xintong Media Co., Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal on Communication / Tongxin Xuebao is the property of Journal on Communications Editorial Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Computer Engineering & Applications is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Ordnance Industry Automation is the property of Editorial Board for Ordnance Industry Automation and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Computer Engineering & Applications is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Chinese Journal of Liquid Crystal & Displays is the property of Chinese Journal of Liquid Crystal & Displays and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Acta Materiae Compositae Sinica is the property of Acta Materiea Compositae Sinica Editorial Department and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Computer Engineering & Applications is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Several different methods of opponent modeling were introduced, leading to the problem of intention recognition in behavior modeling. Then, the process, classification, main methods, research prospects and practical applications of intention recognition were analyzed inductively, the latest research in related fields were summarized. Finally, some shortcomings of the current intention recognition and design methods were pointed out and some new insights for the future research were presented. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Computer Engineering & Applications is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Ordnance Industry Automation is the property of Editorial Board for Ordnance Industry Automation and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Ordnance Industry Automation is the property of Editorial Board for Ordnance Industry Automation and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Ordnance Industry Automation is the property of Editorial Board for Ordnance Industry Automation and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

As an important part of the intelligent planning technology, hierarchical task network (HTN) is successfully applied to the task planning in unmanned aerial vehicle platform, emergency plan formulation and other fields. Due to effect the increasing uncertain factors on the implementation the influence of the plan, it is urgent to use replanning technology, thus the replanning technology based on HTN has become a hotspot in recent years. First of all, a three-layer replan framework based on HTN is proposed by summarizing the current research status. Then, the corresponding technical route and implementation details are represented from three levels of plan repair, local replanning and global replanning in the framework respectively, and the advantages and disadvantages of the current method are pointed out for different levels. Finally, the future research direction of this problem is prospected, and the key problems to be solved and the solutions are putting forward. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Computer Engineering & Applications is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Computer-Aided Design & Computer Graphics / Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao is the property of Gai Kan Bian Wei Hui and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Systems Engineering & Electronics is the property of Journal of Systems Engineering & Electronics Editorial Department and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Telecommunication Engineering is the property of Telecommunication Engineering and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)