The Experts below are selected from a list of 26085 Experts worldwide ranked by ideXlab platform
Minglu Li - One of the best experts on this subject based on the ideXlab platform.
-
A distributed algorithm for web service composition based on service agent model
IEEE Transactions on Parallel and Distributed Systems, 2011Co-Authors: Hongxia Tong, Shensheng Zhang, Jian Cao, Minglu LiAbstract:Agent-based service composition has provided a promising computing paradigm for the automatic web service composition. In this paper, a formal service agent model is proposed, which integrates the web service and software agent technologies into one cohesive entity. Based on the service agent model, a distributed planning algorithm for web service composition called DPAWSC is presented. DPAWSC formalizes web service composition into a Graph Search Problem according to the dependence relations among service agents. The key to DPAWSC is that the alternative solution with smaller length has higher priority to be Searched than one with larger length. DPAWSC is based on the distributed decision making of the autonomous service agents and addresses the distributed nature of web service composition. We evaluate the algorithm by simulation experiments and the results demonstrate that DPAWSC is effective for its ability to produce the high quality solution at a low cost of communications.
Hongxia Tong - One of the best experts on this subject based on the ideXlab platform.
-
A distributed algorithm for web service composition based on service agent model
IEEE Transactions on Parallel and Distributed Systems, 2011Co-Authors: Hongxia Tong, Shensheng Zhang, Jian Cao, Minglu LiAbstract:Agent-based service composition has provided a promising computing paradigm for the automatic web service composition. In this paper, a formal service agent model is proposed, which integrates the web service and software agent technologies into one cohesive entity. Based on the service agent model, a distributed planning algorithm for web service composition called DPAWSC is presented. DPAWSC formalizes web service composition into a Graph Search Problem according to the dependence relations among service agents. The key to DPAWSC is that the alternative solution with smaller length has higher priority to be Searched than one with larger length. DPAWSC is based on the distributed decision making of the autonomous service agents and addresses the distributed nature of web service composition. We evaluate the algorithm by simulation experiments and the results demonstrate that DPAWSC is effective for its ability to produce the high quality solution at a low cost of communications.
Abderrahmane Kheddar - One of the best experts on this subject based on the ideXlab platform.
-
humanoid loco manipulation planning based on Graph Search and reachability maps
International Conference on Robotics and Automation, 2021Co-Authors: Masaki Murooka, Iori Kumagai, Mitsuharu Morisawa, Fumio Kanehiro, Abderrahmane KheddarAbstract:In this letter, we propose an efficient and highly versatile loco-manipulation planning for humanoid robots. Loco-manipulation planning is a key technological brick enabling humanoid robots to autonomously perform object transportation by manipulating them. We formulate planning of the alternation and sequencing of footsteps and grasps as a Graph Search Problem with a new transition model that allows for a flexible representation of loco-manipulation. Our transition model is quickly evaluated by relocating and switching the reachability maps depending on the motion of both the robot and object. We evaluate our approach by applying it to loco-manipulation use-cases, such as a bobbin rolling operation with regrasping, where the motion is automatically planned by our framework.
Shensheng Zhang - One of the best experts on this subject based on the ideXlab platform.
-
A distributed algorithm for web service composition based on service agent model
IEEE Transactions on Parallel and Distributed Systems, 2011Co-Authors: Hongxia Tong, Shensheng Zhang, Jian Cao, Minglu LiAbstract:Agent-based service composition has provided a promising computing paradigm for the automatic web service composition. In this paper, a formal service agent model is proposed, which integrates the web service and software agent technologies into one cohesive entity. Based on the service agent model, a distributed planning algorithm for web service composition called DPAWSC is presented. DPAWSC formalizes web service composition into a Graph Search Problem according to the dependence relations among service agents. The key to DPAWSC is that the alternative solution with smaller length has higher priority to be Searched than one with larger length. DPAWSC is based on the distributed decision making of the autonomous service agents and addresses the distributed nature of web service composition. We evaluate the algorithm by simulation experiments and the results demonstrate that DPAWSC is effective for its ability to produce the high quality solution at a low cost of communications.
Jian Cao - One of the best experts on this subject based on the ideXlab platform.
-
A distributed algorithm for web service composition based on service agent model
IEEE Transactions on Parallel and Distributed Systems, 2011Co-Authors: Hongxia Tong, Shensheng Zhang, Jian Cao, Minglu LiAbstract:Agent-based service composition has provided a promising computing paradigm for the automatic web service composition. In this paper, a formal service agent model is proposed, which integrates the web service and software agent technologies into one cohesive entity. Based on the service agent model, a distributed planning algorithm for web service composition called DPAWSC is presented. DPAWSC formalizes web service composition into a Graph Search Problem according to the dependence relations among service agents. The key to DPAWSC is that the alternative solution with smaller length has higher priority to be Searched than one with larger length. DPAWSC is based on the distributed decision making of the autonomous service agents and addresses the distributed nature of web service composition. We evaluate the algorithm by simulation experiments and the results demonstrate that DPAWSC is effective for its ability to produce the high quality solution at a low cost of communications.
