No abstract

Since the insertion area in the middle ear or in the sinus cavity is very narrow, the mobility of the endoscope is reduced to a rotation around a virtual point and a translation for the insertion of the camera. This article first presents the anatomy of these regions obtained from 3D scanning and then a mechanism based on the architecture of the agile eye coupled to a double parallelogram to create an RCM. This mechanism coupled with a positioning mechanism is used to handle an endoscope. This tool is used in parallel to the surgeon to allow him to have better rendering of the medium ear than the use of Binocular scope. The mechanism offers a wide working space without singularity whose borders are fixed by joint limits. This feature allows ergonomic positioning of the patient's head on the bed as well as for the surgeon and allows other applications such as sinus surgery.

No abstract

In this paper, a kinematic motion planning algorithm for cooperative spatial payload manipulation is presented. A hierarchical approach is introduced to compute realtime collision-free motion plans for a formation of mobile manipulator robots. Initially, collision-free configurations of a deformable 2-D virtual bounding box are identified, over a planning horizon, to define a convex workspace for the entire system. Then, 3-D payload configurations whose projections lie within the defined convex workspace are computed. Finally, a convex decentralized model-predictive controller is formulated to plan collision-free trajectories for the formation of mobile manipulators. This approach facilitates real-time motion planning for the system and is scalable in the number of robots. The algorithm is validated in simulated dynamic environments. Simulation video: https://youtu.be/9EKj7RwRs_4.

In otolaryngologic surgery, endoscopy is increasingly used to provide a better view of hard-to-reach areas and to promote minimally invasive surgery. However, the need to manipulate the endoscope limits the surgeon's ability to operate with only one instrument at a time. Currently, several robotic systems are being developed, demonstrating the value of robotic assistance in microsurgery. The aim of this literature review is to present and classify current robotic systems that are used for otological and endonasal applications. For these solutions, an analysis of the functionalities in relation to the surgeon's needs will be carried out in order to produce a set of specifications for the creation of new robots.

In otolaryngologic surgery, more and more robots are being studied to meet the clinical needs of operating rooms. However, to help design and optimize these robots, the workspace must be precisely defined taking into account patient variability. The aim of this work is to define a geometric atlas of the middle ear and paranasal sinuses for endoscopic robotic applications. Scans of several patients of different ages and sexes were used to determine the average size of these workspaces, which are linked by the similar use of endoscopes in surgery.

Cuspidal robots are robots with at least two inverse kinematic solutions that can be connected by a singularity-free path. Deciding the cuspidality of generic 3R robots has been studied in the past, but extending the study to six-degree-of-freedom robots can be a challenging problem. Many robots can be modeled as a polynomial map together with a real algebraic set so that the notion of cuspidality can be extended to these data.In this paper we design an algorithm that, on input a polynomial map in n indeterminates, and s polynomials in the same indeterminates describing a real algebraic set of dimension d, decides the cuspidality of the restriction of the map to the real algebraic set under consideration. Moreover, if D and τ are, respectively the maximum degree and the bound on the bit size of the coefficients of the input polynomials, this algorithm runs in time log-linear in τ and polynomial in ((sIt relies on many high-level algorithms in computer algebra which use advanced methods on real algebraic sets and critical loci of polynomial maps. As far as we know, this is the first algorithm that tackles the cuspidality problem from a general point of view. CCS CONCEPTS• Computing methodologies → Symbolic and algebraic algorithms; Computer algebra systems.

No abstract