• Title/Summary/Keyword: Navigation Mesh

Search Result 52, Processing Time 0.026 seconds

Efficient Path Tracking of Non-Player Character with Controlling NavMesh Based on Smoothed Heaviside Step Function (부드러운 헤비사이드 계단 함수 기반의 NavMesh 제어 기법을 이용한 효율적인 NPC의 경로 추적)

  • Kim, Jong-Hyun;Kim, Soo Kyun
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • 2022.01a
    • /
    • pp.339-340
    • /
    • 2022
  • 본 논문에서는 사용자의 다양한 물리적 속성 중 부드러운 헤비사이드 계단 함수와 다양한 물리적 속성(속도, 시점 등)을 활용하여 가중치 맵을 계산하고 이로부터 논플레이어 캐릭터(Non-player character, NPC)의 경로를 효율적으로 제어할 수 있는 NavMesh 제어 기법을 제시한다. 게임과 같은 가상환경에서 NPC는 일반적으로 네비게이션 메쉬(Navigation mesh, NavMesh)를 이용하여 이동한다. 하지만, NavMesh는 정적인 형태이기 때문에 사용자에 의해 디자인되어야 하고, 이러한 문제를 완화하고자 자동으로 NavMesh를 업데이트하는 기술이 연구되고 있지만, 메쉬 복원을 자동화할 뿐 실제 NPC 행동 제어라고 하기에는 힘든 접근법이다. 본 논문에서는 동적 네비게이션 프레임워크를 유지한 채, 사용자의 시점과 물리적 특성을 통해 NPC를 효율적이고 정확하게 경로 제어할 수 있는 방법을 제안하고, NavMesh의 형태에만 의존하던 NPC의 움직임을 완화하여 좀 더 사실적인 경로 제어를 보여준다.

  • PDF

A Parallel Algorithm for Finding Routes in Cities with Diagonal Streets

  • Hatem M. El-Boghdadi
    • International Journal of Computer Science & Network Security
    • /
    • v.24 no.1
    • /
    • pp.45-51
    • /
    • 2024
  • The subject of navigation has drawn a large interest in the last few years. The navigation within a city is to find the path between two points, source location and destination location. In many cities, solving the routing problem is very essential as to find the route between different locations (starting location (source) and an ending location (destination)) in a fast and efficient way. This paper considers streets with diagonal streets. Such streets pose a problem in determining the directions of the route to be followed. The paper presents a solution for the path planning using the reconfigurable mesh (R-Mesh). R-Mesh is a parallel platform that has very fast solutions to many problems and can be deployed in moving vehicles and moving robots. This paper presents a solution that is very fast in computing the routes.

A Dynamic Path-Finding Method Avoiding Moving Obstacles in 3D Game Environment (3D게임에서 이동 장애물을 고려한 동적 경로 탐색 기법)

  • Kwon, Oh-Ik;WhangBo, Teag-Keun
    • Journal of Korea Game Society
    • /
    • v.6 no.3
    • /
    • pp.3-12
    • /
    • 2006
  • Path-finding, one of the traditional Game A.I. problems, becomes an important issue to make games more realistic. Due to the limited resources in the computer system, path-finding systems sometimes produce a simplified and unrealistic path. The most relent researches have been focused on the path-finding avoiding only static obstacles. Various moving obstacles are however deployed in real games, a method avoiding those obstacles and producing a smooth path is necessary. In this paper, navigation mesh is used to represent 3D space and its topological characteristics are used for path-finding. Intellectual repulser and attractor are also used to avoid moving obstacles and to find an optimal path. We have evaluated the path produced by the method proposed in this paper and verified its usability in real game.

  • PDF

Efficient Path Finding in 3D Games by Using Visibility Tests (가시성 검사를 이용한 3차원 게임에서의 효율적인 경로 탐색)

  • Kim, Hyung-Il;Jung, Dong-Min;Um, Ky-Hyun;Cho, Hyung-Je;Kim, Jun-Tae
    • Journal of Korea Multimedia Society
    • /
    • v.9 no.11
    • /
    • pp.1483-1495
    • /
    • 2006
  • The navigation mesh represents a terrain as a set of triangles on which characters may move around. The navigation mesh cab be generated automatically, and it is more flexible in representing 3D surface. The number of triangles to represent a terrain may vary according to the structure of the terrain. As characters are moving around on a navigation mesh, the path planning can be performed more easily by projecting the 3D surfaces into 2D space. However, when the terrain is represented with an elaborated mesh of large number of triangles to achieve more realistic movements, the path finding can be very inefficient because there are too many states(triangles) to be searched. In this paper, we propose an efficient method of path finding in 3D games where the terrain is represented by navigation meshes. Our method uses the visibility tests. When the graph-based search is applied to elaborated polygonal meshes for detailed terrain representation, the path finding can be very inefficient because there are too many states(polygons) to be searched. In our method, we reduce the search space by using visibility tests so that the search can be fast even on the detailed terrain with large number of polygons. First we find the visible vertices of the obstacles, and define the heuristic function as the distance to the goal through those vertices. By doing that, the number of states that the graph-based search visits can be substantially reduced compared to the plane search with straight-line distance heuristic.

  • PDF

Virtual Navigation of Blood Vessels using 3D Curve-Skeletons (3차원 골격곡선을 이용한 가상혈관 탐색 방안)

  • Park, Sang-Jin;Park, Hyungjun
    • Korean Journal of Computational Design and Engineering
    • /
    • v.22 no.1
    • /
    • pp.89-99
    • /
    • 2017
  • In order to make a virtual endoscopy system effective for exploring the interior of the 3D model of a human organ, it is necessary to generate an accurate navigation path located inside the 3D model and to obtain consistent camera position and pose estimation along the path. In this paper, we propose an approach to virtual navigation of blood vessels, which makes proper use of orthogonal contours and skeleton curves. The approach generates the orthogonal contours and the skeleton curves from the 3D mesh model and its voxel model, all of which represent the blood vessels. For a navigation zone specified by two nodes on the skeleton curves, it computes the shortest path between the two nodes, estimates the positions and poses of a virtual camera at the nodes in the navigation zone, and interpolates the positions and poses to make the camera move smoothly along the path. In addition to keyboard and mouse input, intuitive hand gestures determined by the Leap Motion SDK are used as user interface for virtual navigation of the blood vessels. The proposed approach provides easy and accurate means for the user to examine the interior of 3D blood vessels without any collisions between the camera and their surface. With a simple user study, we present illustrative examples of applying the approach to 3D mesh models of various blood vessels in order to show its quality and usefulness.

Improved AODV Routing Protocol for Optimized Path over Wireless Mesh Network (무선 메쉬 네트워크에서 최적의 경로 설정을 위한 개선된 AODV 라우팅 프로토콜)

  • Kim, Yu-Doo;Moon, Il-Young
    • Journal of Advanced Navigation Technology
    • /
    • v.12 no.4
    • /
    • pp.350-356
    • /
    • 2008
  • The recent networks are trending toward wireless networks. So wireless internet used to service of wired networks. But wireless networks can't show same performance of wired networks. Therefore, we are must concerned about Routing Protocol for improvement of a weak point of physical feature. But many researchers are not focusing on developing Routing Protocol. In this paper, we improve on AODV(Ad-hoc On-demand Distance Vector) for Wireless Mesh Networks. And it analyzed the result of simulation.

  • PDF

The Automatic Mesh Refinement of FEM and Posteriori Error Estimation (유한요소의 자동 재분할과 사후오차평가)

  • Kim, B. I.;Bai, S. H.;Chang, C. D.
    • Journal of Korean Port Research
    • /
    • v.10 no.2
    • /
    • pp.61-68
    • /
    • 1996
  • The main problems in structural analysis by Finite Eelement Method are difficulty in making data file and error estimation. For decreasing these problems' pays. have been suggesting the adaptive mesh refinement and error estimation method. Posteriory error estimation methods suggested by Jang[1], Babuska[2,3], Ohtsubo[8,9], and this paper. Comparing these methods and examine their properties. According this paper, In the problem supposed having singularity, the method suggested by this paper is good, But the problem supposed having no singularity, the method suggested by Jang[1] is good. For decreasing the effect of initial mesh in p-refinement, make application h-refinement at first and apply p-refinement, and confine polynomial's degree to two, for making program simply by plural mesh models are not needed.

  • PDF

Real-Time Path Finding on Dynamic 3D Game Environment (동적 3D 게임 환경에서의 실시간 경로탐색)

  • Kwon, Oh-Ik;WhangBo, Taeg-Keun
    • 한국HCI학회:학술대회논문집
    • /
    • 2006.02a
    • /
    • pp.824-829
    • /
    • 2006
  • 한정된 자원을 사용할 수 있는 게임 AI 분야에서는 시스템 자원을 적절하게 활용하여 현실감을 극대화 시키려는 노력이 중요한 이슈이며, 3D 게임에서 캐릭터들의 자연스러운 경로 탐색은 현실성을 높이는 중요한 척도 중 하나이다. 기존 연구에서는 주로 정적인 지형, 객체들을 적절하게 회피하는 경로에 대한 연구가 많이 진행되었다. 그러나 최근 널리 이용되고 있는 다중사용자가 접속하는 온라인 RPG 게임에서는 기존 방법을 그대로 적용하기에 많은 연산량이 필요한 문제점이 있다. 본 논문에서는 네비게이션 메시(Navigation Mesh) 기반으로 최적화된 A*, 그리고 밀개(Repulsors)의 방법을 통하여 동적인 환경에서 자연스러운 경로탐색을 수행하며 3D 게임에 적용 가능한 연산량을 충족하는 경로탐색 시스템을 제안하였다.

  • PDF

Flow Interaction of Sailing Drone using Numerical Method

  • Ngoc, Pham Minh;Choi, Min-Seon;Yang, Changjo
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • 2019.11a
    • /
    • pp.230-232
    • /
    • 2019
  • There is an accelerating need for ocean sensing where autonomous vehicles can play a key role in assisting engineers, researcher and scientists with environmental monitoring and collecting oceanographic data. This paper is performed to develops an autonomous sailing drone to be used as a sensor carrying platform for autonomous data acquisition at Sea. From a sailing drone design viewpoint, it is important to establish reliable prediction methods for sailing drone's resistance. The required power for the propulsion unit depends on the ship resistance and speed. There are three solutions for the prediction of ship resistance as follow analytical methods, model tests in tanks and Computational Fluid Dynamics (CFD). The present paper aims at simulating sailing drone friction resistance using numerical method. The dynamic mesh motion is used to describe the sailing drone movement.

  • PDF

Development of Generating Technique for Triangular Mesh by using Distinct Element Method (개별요소법을 이용한 삼각망 생성기법 개발)

  • Kim, Nam-Hyeong;Yun, Hyeon-Cheol;Hur, Young-Teck
    • Journal of Navigation and Port Research
    • /
    • v.34 no.5
    • /
    • pp.367-373
    • /
    • 2010
  • When the numerical analysis is carried out, it is necessary to set proper elements as a feature of analysis domains for more accurate simulations. In this study, Distinct Element Method(DEM) is applied, only considering repulsive force and tensile force except for frictional force and resisting force of particle. When the filled particles with initial Quad-tree type is relocated by DEM, a blank space existing among the particles can be minimized because the shape of particle is circular. Finally, it is the effective feature that the centroidal disposion of the particles is similar to an equilateral triangle. Triangular mesh are formed by using the Delaunay triangular technique on these relocated particles, the quality of triangular mesh is more improved by carrying out Laplace interpolations. The compared result of Aspect Ratio before and after the Laplace interpolation is shown that although the quality of triangular mesh made by DEM is good, the later triangular mesh are higher quality than the formers. In this study, although the developed technique takes a longer calculational time than the previous technique to generate triangular mesh, it is considered that the applicable possibility is very high in the generation of finite element mesh about wave analysis and various numerical simulation to need a complex or reappearance of exact topography.