Statistical Equivalent Models, or SEMs, have recently attracted considerable interest as a general approach to study computer simulators. By fitting a statistical model to the simulator’s output, SEMs provide an efficient way to quickly explore the simulator’s result. In this paper, we develop a SEM for random waypoint mobility, one of the most widely used mobility models employed by network si...

This paper proposes the use of an autonomous exploring agent to generate and annotate the waypoint graph as an offline process during level development. The explorer incrementally generates the waypoint graph as it explores the level via the same motion model used for player movement, and then revisits the waypoints to annotate them using image-based techniques. Points where the explorer become...

Problem statement: In this research, it had been presented a novel Skew Scenario Model that has been developed and implemented for mobile ad hoc networks. There exist several mobility patterns that try to capture the behavior of the mobile devices under different circumstances, whereas in our work, the direction movement of the nodes is significantly specified horizontally, vertically and diago...

This paper investigates the performance of a multihop radio access network. In our testbed, nodes communicate to one access point using IEEE 802.11b and AODV routing. We measure the average packet delay and delivery ratio, if the node movement is emulated employing the random waypoint and random direction model, respectively. We find that random waypoint mobility yields up to 100% better result...

In the Waypoint Routing Problem one is given an undirected capacitated and weighted graph G, a source-destination pair s,t?V(G) set W?V(G), of waypoints. The task to find walk which starts at source vertex s, visits, in any order, all waypoints, ends destination t, respects edge capacities, that is, traverses each most as many times its capacity, minimizes cost computed sum costs traversed edge...

This paper proposes the use of an autonomous exploring agent to generate and annotate the waypoint graph as an offline process during level development. The explorer incrementally generates the waypoint graph as it explores the level via the same motion model used for player movement, and then revisits the waypoints to annotate them using image-based techniques. Points where the explorer become...

In this paper we study the so-called random waypoint (RWP) mobility model in the context of cellular networks. In the RWP model the nodes, i.e. mobile users, move along a zigzag path consisting of straight legs from one waypoint to the next. Each waypoint is assumed to be drawn from the uniform distribution over the given convex domain. In this paper we characterise the key performance measures...

This paper introduces a reinforcement learning (RL) based autonomous waypoint generation strategy (AWGS), for on-line path planning in unknown environments. An RL agent intelligently analyzes its surroundings and generates waypoints within the robot’s field of view. The RL agent uses an MDP for waypoint generation that is formulated to be independent of the domain, robot model, and state space ...

This paper presents terrain reasoning based on the waypoint graph typically present in 3D action games. It discusses terrain reasoning concepts, and how the waypoint graph can be reasoned about. The paper discusses and demonstrates the relation between tactics and terrain. A case-study shows how to develop off-line and in-game reasoning to pick good sniping spots, and how to use game-play feedb...