Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

Multi-fingered haptic interaction in a virtual prototyping environment

Kron A., Schmidt G.

Systems Science

2001

Vol. 27, nr 4

9-22

The majority of current Virtual Prototyping (VP) systems are capable of providing high fidelity visual feedback only, leaving users in a more or less passive role. This paper discusses an upgrading of the visual feedback by haptic feedback. By allowing the user to interact with objects in a Virtual Environment (VE) with his/her hands and fingers such an advanced VP system permits them to play an active role. For the purposes of upgrading a wrist/finger kinesthetic display as well as a vibrotactile and temperature globe were developed. The combination of both devices leads to a novel haptic human system interface. This paper describes the interface hardware and the corresponding haptic rendering algorithms for generating a high fidelity haptic feedback from a VP environment. Moreover, experimental results are reported concerning the performance of the various haptic displays as well as the quality of the generated haptic sensations. An outlook to future multimodal VP techniques is given.

Parallel Branch and Bound Algorithms for the Two-machine Flow Shop Problem with Limited Machine Availability

Błażewicz J., Formanowicz P., Kubiak W., Przysucha M., Schmidt G.

Bulletin of the Polish Academy of Sciences. Technical Sciences

2000

Vol. 48, nr 1

105-115

The paper presents parallel versions of a branch and bound algorithm for scheduling jobs in the two-machine flow shop were machines have some periods of limited availability. A problem of minimizing makespan in such a flow shop is NP-hard in the strong sense. Moreover, no polynomial time heuristic with finite relative error exists for the problem unless P = NP. One of the standard approaches for solving intractable problems is a branch and bound method. In this paper, a parallel implementation of the branch and bound algorithm solving the problem considered, and the results of computational experiments, are presented. Surprisingly, the tests carried out showed that the best results in case of parallel computations were obtained when a simple depth first search strategy was used.