Miniature in vivo Robots for Remote and Harsh Environments

University of Nebraska Medical Center, Omaha, NE 68198, USA.
IEEE Transactions on Information Technology in Biomedicine (Impact Factor: 2.49). 02/2008; 12(1):66-75. DOI: 10.1109/TITB.2007.898017
Source: PubMed


Long-term human space exploration will require contingencies for emergency medical procedures including some capability to perform surgery. The ability to perform minimally invasive surgery (MIS) would be an important capability. The use of small incisions reduces surgical risk, but also eliminates the ability of the surgeon to view and touch the surgical environment directly. Robotic surgery, or telerobotic surgery, may provide emergency surgical care in remote or harsh environments such as space flight, or extremely forward environments such as battlefields. However, because current surgical robots are large and require extensive support personnel, their implementation has remained limited in forward environments, and they would be difficult, or impossible, to use in space flight or on battlefields. This paper presents experimental analysis of miniature fixed-base and mobile in vivo robots to support MIS surgery in remote and harsh environments. The objective is to develop wireless imaging and task-assisting robots that can be placed inside the abdominal cavity during surgery. Such robots will provide surgical task assistance and enable an on-site or remote surgeon to view the surgical environment from multiple angles. This approach is applicable to long-duration space flight, battlefield situations, and for traditional medical centers and other remote surgical locations.

Download full-text


Available from: Jason Dumpert, Oct 10, 2015
32 Reads
  • Source
    • "We are already on the beginning of the minirobotic revolution and translation from mini invasive surgery to pure intracavitary surgery. The technical potential of " in vivo robots " has to be investigated, well defined, and established in the clinical field to eliminate the difficulties in LESS surgeries [15] "
    [Show abstract] [Hide abstract]
    ABSTRACT: Laparo-Endoscopic Single-Site surgery (LESS) for kidney diseases is quickly evolving and has a tendency to expand the urological armory of surgical techniques. However, we should not be overwhelmed by the surgical skills only and weight it against the basic clinical and oncological principles when compared to standard laparoscopy. The initial goal is to define the ideal candidates and ideal centers for LESS in the future. Modification of basic instruments in laparoscopy presumably cannot result in better functional and oncological outcomes, especially when the optimal working space is limited with the same arm movements. Single port surgery is considered minimally invasive laparoscopy; on the other hand, when using additional ports, it is no more single port, but hybrid traditional laparoscopy. Whether LESS is a superior or equally technique compared to traditional laparoscopy has to be proven by future prospective randomized trials.
    Diagnostic and Therapeutic Endoscopy 02/2010; 2010:759431. DOI:10.1155/2010/759431
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, a self-adaptive algorithm of a packet scheduler is addressed as a crucial method of high-speed transmission of multimedia traffic in a shared wireless link, in accordance with new architectural functions. In the slot budget that is updated sequentially in the order of priorities of applications and sessions, adaptive modulation and coding options are considered to take into account radio links subject to fading and interference. The dedicated local packet scheduler that is in control of each type of application employs an application-sensitive scheduling algorithm. For real-time scheduler, the forward-equilibrium algorithm is introduced to consider the future state of delay. When it comes to non real-time scheduler, the adaptive-fair-selection algorithm is developed to provide the fairness between sessions. The global packet scheduler manages the overall operation of the dedicated local packet schedulers and supervises the slot budget in each transmission-time-interval making a final decision. The scheduler can provide the local fairness between sessions in each service class. Related to the bounds on delay, real-time sessions can be served with predefined requirements at the cost of increased packet dropping rates. Implementation complexity is thought to be simple, providing a low-complexity algorithm in the local scheduler for the nonreal-time class.
    Communication Technology Proceedings, 2003. ICCT 2003. International Conference on; 05/2003
Show more