The Experts below are selected from a list of 33252 Experts worldwide ranked by ideXlab platform
Y. Hasegawa - One of the best experts on this subject based on the ideXlab platform.
-
Direct teaching and error recovery method for assembly task based on a transition process of a Constraint Condition
Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164), 2001Co-Authors: T. Fukuda, Masashi Nakaoka, Takahisa Ueyama, Y. HasegawaAbstract:A method for simplification of teaching in robotic assembly is presented. Generally, an assembly task is a process in which a Constraint Condition between two workpieces changes. There has been much research on teaching an assembly task to a robot system by a model-based approach. However, it takes a lot of time to revise information of models that depend on the task environment when every new task is taught to a robot in these model-based approaches. We propose a method to simplify teaching by taking an approach where a human teaches a task to a robot without giving models of the task environment and task processes. Additionally, we also propose a method to realize robotic assembly that is robust to errors by executing a task as a transition process of a Constraint Condition. Experimental results show the effectiveness of our method.
-
ICRA - Direct teaching and error recovery method for assembly task based on a transition process of a Constraint Condition
Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164), 1Co-Authors: T. Fukuda, Masashi Nakaoka, Takahisa Ueyama, Y. HasegawaAbstract:A method for simplification of teaching in robotic assembly is presented. Generally, an assembly task is a process in which a Constraint Condition between two workpieces changes. There has been much research on teaching an assembly task to a robot system by a model-based approach. However, it takes a lot of time to revise information of models that depend on the task environment when every new task is taught to a robot in these model-based approaches. We propose a method to simplify teaching by taking an approach where a human teaches a task to a robot without giving models of the task environment and task processes. Additionally, we also propose a method to realize robotic assembly that is robust to errors by executing a task as a transition process of a Constraint Condition. Experimental results show the effectiveness of our method.
T. Fukuda - One of the best experts on this subject based on the ideXlab platform.
-
Direct teaching and error recovery method for assembly task based on a transition process of a Constraint Condition
Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164), 2001Co-Authors: T. Fukuda, Masashi Nakaoka, Takahisa Ueyama, Y. HasegawaAbstract:A method for simplification of teaching in robotic assembly is presented. Generally, an assembly task is a process in which a Constraint Condition between two workpieces changes. There has been much research on teaching an assembly task to a robot system by a model-based approach. However, it takes a lot of time to revise information of models that depend on the task environment when every new task is taught to a robot in these model-based approaches. We propose a method to simplify teaching by taking an approach where a human teaches a task to a robot without giving models of the task environment and task processes. Additionally, we also propose a method to realize robotic assembly that is robust to errors by executing a task as a transition process of a Constraint Condition. Experimental results show the effectiveness of our method.
-
ICRA - Direct teaching and error recovery method for assembly task based on a transition process of a Constraint Condition
Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164), 1Co-Authors: T. Fukuda, Masashi Nakaoka, Takahisa Ueyama, Y. HasegawaAbstract:A method for simplification of teaching in robotic assembly is presented. Generally, an assembly task is a process in which a Constraint Condition between two workpieces changes. There has been much research on teaching an assembly task to a robot system by a model-based approach. However, it takes a lot of time to revise information of models that depend on the task environment when every new task is taught to a robot in these model-based approaches. We propose a method to simplify teaching by taking an approach where a human teaches a task to a robot without giving models of the task environment and task processes. Additionally, we also propose a method to realize robotic assembly that is robust to errors by executing a task as a transition process of a Constraint Condition. Experimental results show the effectiveness of our method.
Takahisa Ueyama - One of the best experts on this subject based on the ideXlab platform.
-
Direct teaching and error recovery method for assembly task based on a transition process of a Constraint Condition
Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164), 2001Co-Authors: T. Fukuda, Masashi Nakaoka, Takahisa Ueyama, Y. HasegawaAbstract:A method for simplification of teaching in robotic assembly is presented. Generally, an assembly task is a process in which a Constraint Condition between two workpieces changes. There has been much research on teaching an assembly task to a robot system by a model-based approach. However, it takes a lot of time to revise information of models that depend on the task environment when every new task is taught to a robot in these model-based approaches. We propose a method to simplify teaching by taking an approach where a human teaches a task to a robot without giving models of the task environment and task processes. Additionally, we also propose a method to realize robotic assembly that is robust to errors by executing a task as a transition process of a Constraint Condition. Experimental results show the effectiveness of our method.
-
ICRA - Direct teaching and error recovery method for assembly task based on a transition process of a Constraint Condition
Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164), 1Co-Authors: T. Fukuda, Masashi Nakaoka, Takahisa Ueyama, Y. HasegawaAbstract:A method for simplification of teaching in robotic assembly is presented. Generally, an assembly task is a process in which a Constraint Condition between two workpieces changes. There has been much research on teaching an assembly task to a robot system by a model-based approach. However, it takes a lot of time to revise information of models that depend on the task environment when every new task is taught to a robot in these model-based approaches. We propose a method to simplify teaching by taking an approach where a human teaches a task to a robot without giving models of the task environment and task processes. Additionally, we also propose a method to realize robotic assembly that is robust to errors by executing a task as a transition process of a Constraint Condition. Experimental results show the effectiveness of our method.
Masashi Nakaoka - One of the best experts on this subject based on the ideXlab platform.
-
Direct teaching and error recovery method for assembly task based on a transition process of a Constraint Condition
Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164), 2001Co-Authors: T. Fukuda, Masashi Nakaoka, Takahisa Ueyama, Y. HasegawaAbstract:A method for simplification of teaching in robotic assembly is presented. Generally, an assembly task is a process in which a Constraint Condition between two workpieces changes. There has been much research on teaching an assembly task to a robot system by a model-based approach. However, it takes a lot of time to revise information of models that depend on the task environment when every new task is taught to a robot in these model-based approaches. We propose a method to simplify teaching by taking an approach where a human teaches a task to a robot without giving models of the task environment and task processes. Additionally, we also propose a method to realize robotic assembly that is robust to errors by executing a task as a transition process of a Constraint Condition. Experimental results show the effectiveness of our method.
-
ICRA - Direct teaching and error recovery method for assembly task based on a transition process of a Constraint Condition
Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164), 1Co-Authors: T. Fukuda, Masashi Nakaoka, Takahisa Ueyama, Y. HasegawaAbstract:A method for simplification of teaching in robotic assembly is presented. Generally, an assembly task is a process in which a Constraint Condition between two workpieces changes. There has been much research on teaching an assembly task to a robot system by a model-based approach. However, it takes a lot of time to revise information of models that depend on the task environment when every new task is taught to a robot in these model-based approaches. We propose a method to simplify teaching by taking an approach where a human teaches a task to a robot without giving models of the task environment and task processes. Additionally, we also propose a method to realize robotic assembly that is robust to errors by executing a task as a transition process of a Constraint Condition. Experimental results show the effectiveness of our method.
Mamoru Sawahashi - One of the best experts on this subject based on the ideXlab platform.
-
fast packet scheduling algorithm based on instantaneous sir with Constraint Condition assuring minimum throughput in forward link
Wireless Communications and Networking Conference, 2003Co-Authors: Yoshiaki Ofuji, S Abeta, Mamoru SawahashiAbstract:This paper proposes a new fast packet-scheduling algorithm based on instantaneous received signal-to-inference power ratio (SIR) with a Constraint Condition that assures a minimum throughput (minimum throughput assured instantaneous SIR (MTA-ISIR) method hereafter) and investigates its throughput performance in high-speed downlink packet access (HSDPA). In the proposed algorithm, packet transmission is assigned with priority based on the instantaneous received SIR for users with a larger average received SIR than the prescribed threshold value, and packet transmission is fairly assigned to users who have smaller average SIR than the threshold value by raising the instantaneous SIR corresponding to the threshold value. Computer simulation results elucidate that the number of high-rate users with a user throughput more than 2-Mbps employing the proposed MTA-ISIR method is increased by approximately 1.9 (1.5) times that using the proportional fairness method while maintaining a similar level of fairness for low-rate users when the threshold value is 18 dB in a 2(1)-path Rayleigh fading channel.
-
WCNC - Fast packet scheduling algorithm based on instantaneous SIR with Constraint Condition assuring minimum throughput in forward link
2003 IEEE Wireless Communications and Networking 2003. WCNC 2003., 1Co-Authors: Yoshiaki Ofuji, S Abeta, Mamoru SawahashiAbstract:This paper proposes a new fast packet-scheduling algorithm based on instantaneous received signal-to-inference power ratio (SIR) with a Constraint Condition that assures a minimum throughput (minimum throughput assured instantaneous SIR (MTA-ISIR) method hereafter) and investigates its throughput performance in high-speed downlink packet access (HSDPA). In the proposed algorithm, packet transmission is assigned with priority based on the instantaneous received SIR for users with a larger average received SIR than the prescribed threshold value, and packet transmission is fairly assigned to users who have smaller average SIR than the threshold value by raising the instantaneous SIR corresponding to the threshold value. Computer simulation results elucidate that the number of high-rate users with a user throughput more than 2-Mbps employing the proposed MTA-ISIR method is increased by approximately 1.9 (1.5) times that using the proportional fairness method while maintaining a similar level of fairness for low-rate users when the threshold value is 18 dB in a 2(1)-path Rayleigh fading channel.
