<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>http://robowiki.net/w/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Lavenderwong</id>
	<title>Robowiki - User contributions [en]</title>
	<link rel="self" type="application/atom+xml" href="http://robowiki.net/w/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Lavenderwong"/>
	<link rel="alternate" type="text/html" href="http://robowiki.net/wiki/Special:Contributions/Lavenderwong"/>
	<updated>2026-04-24T18:08:19Z</updated>
	<subtitle>User contributions</subtitle>
	<generator>MediaWiki 1.34.1</generator>
	<entry>
		<id>http://robowiki.net/w/index.php?title=Thread:Talk:Main_Page/Running_Error_-_Robot_is_not_stopping,_forcing_a_stop&amp;diff=32636</id>
		<title>Thread:Talk:Main Page/Running Error - Robot is not stopping, forcing a stop</title>
		<link rel="alternate" type="text/html" href="http://robowiki.net/w/index.php?title=Thread:Talk:Main_Page/Running_Error_-_Robot_is_not_stopping,_forcing_a_stop&amp;diff=32636"/>
		<updated>2013-12-07T07:13:26Z</updated>

		<summary type="html">&lt;p&gt;Lavenderwong: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;When I start the battlefield,my robot and other enemy are frozen. The println messages are not displayed in the robot console. But the command prompt shows the following error. I check that the cause of error is the addition of node in my queue (queue.add(n)). However, this line of code shall be fine i guess. So I would like to ask how to solve this error message?&lt;br /&gt;
(this part of my program is for path finding using bfs)&lt;br /&gt;
&lt;br /&gt;
Thank you.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
***** BATTLE 1, ROUND 1 *****&lt;br /&gt;
&lt;br /&gt;
TURN 1: StudentRobot* (1) hard deadline exceeded - 532809us&lt;br /&gt;
&lt;br /&gt;
Err&amp;gt; Robot StudentRobot* (1) is not stopping.  Forcing a stop.&lt;br /&gt;
&lt;br /&gt;
Err&amp;gt; Robot StudentRobot* (2) is not stopping.  Forcing a stop.&lt;br /&gt;
&lt;br /&gt;
Average computation time per turn: 511706&lt;br /&gt;
&lt;br /&gt;
Max turn computation time: 532809&lt;br /&gt;
&lt;br /&gt;
&amp;lt;code&amp;gt;&lt;br /&gt;
private boolean pathFinding_BFS(Node start, Node end){&lt;br /&gt;
&lt;br /&gt;
		LinkedList&amp;lt;Node&amp;gt; queue = new LinkedList&amp;lt;Node&amp;gt;();&lt;br /&gt;
&lt;br /&gt;
		queue.add(start);&lt;br /&gt;
&lt;br /&gt;
		start.setMarked();&lt;br /&gt;
&lt;br /&gt;
		while (!queue.isEmpty()){&lt;br /&gt;
&lt;br /&gt;
			Node temp = (Node)queue.poll();&lt;br /&gt;
&lt;br /&gt;
			System.out.println(&amp;quot;first node:&amp;quot; + temp.getPointInPath().getX() + &amp;quot; y &amp;quot; + temp.getPointInPath().getY());&lt;br /&gt;
&lt;br /&gt;
			if (temp.equals(end)){&lt;br /&gt;
&lt;br /&gt;
				temp.setPrevNodeInPath(temp.getPrevNodeInPath());&lt;br /&gt;
&lt;br /&gt;
				return true;&lt;br /&gt;
&lt;br /&gt;
			}else{&lt;br /&gt;
&lt;br /&gt;
				for (Node n : temp.getAdjacentNode()){	&lt;br /&gt;
&lt;br /&gt;
					System.out.println(&amp;quot;in node:&amp;quot; + n.getPointInPath().getX() + &amp;quot; y &amp;quot; + &lt;br /&gt;
n.getPointInPath().getY());&lt;br /&gt;
&lt;br /&gt;
					if (!n.isMarked()){&lt;br /&gt;
&lt;br /&gt;
						n.setMarked();&lt;br /&gt;
&lt;br /&gt;
						n.setPrevNodeInPath(temp);&lt;br /&gt;
&lt;br /&gt;
						System.out.println(&amp;quot;test n&amp;quot;);&lt;br /&gt;
&lt;br /&gt;
						queue.add(n);  //problem here&lt;br /&gt;
&lt;br /&gt;
					}&lt;br /&gt;
				}&lt;br /&gt;
			}&lt;br /&gt;
						&lt;br /&gt;
		}&lt;br /&gt;
		return false;&lt;br /&gt;
	}&lt;br /&gt;
	&lt;br /&gt;
&lt;br /&gt;
	public  List&amp;lt;Point&amp;gt; getShortestPath(Point start){&lt;br /&gt;
&lt;br /&gt;
		Node src = new Node(start);&lt;br /&gt;
&lt;br /&gt;
		List&amp;lt;Point&amp;gt; path = new ArrayList&amp;lt;Point&amp;gt;();&lt;br /&gt;
&lt;br /&gt;
		for (int i=0;i&amp;lt;endup.size();i++){&lt;br /&gt;
&lt;br /&gt;
			Node destination = new Node(endup.get(i));&lt;br /&gt;
&lt;br /&gt;
			if (pathFinding_BFS(src, destination)){&lt;br /&gt;
&lt;br /&gt;
				while (destination.getPrevNodeInPath() != null){&lt;br /&gt;
&lt;br /&gt;
					destination = destination.getPrevNodeInPath();&lt;br /&gt;
&lt;br /&gt;
					path.add(destination.getPointInPath());&lt;br /&gt;
&lt;br /&gt;
				}&lt;br /&gt;
&lt;br /&gt;
				Collections.reverse(path);&lt;br /&gt;
&lt;br /&gt;
				return path;&lt;br /&gt;
			}&lt;br /&gt;
&lt;br /&gt;
		}&lt;br /&gt;
		return path;&lt;br /&gt;
	}&lt;br /&gt;
&amp;lt;/code&amp;gt;&lt;/div&gt;</summary>
		<author><name>Lavenderwong</name></author>
		
	</entry>
	<entry>
		<id>http://robowiki.net/w/index.php?title=Thread:Talk:Main_Page/Running_Error_-_Robot_is_not_stopping,_forcing_a_stop&amp;diff=32635</id>
		<title>Thread:Talk:Main Page/Running Error - Robot is not stopping, forcing a stop</title>
		<link rel="alternate" type="text/html" href="http://robowiki.net/w/index.php?title=Thread:Talk:Main_Page/Running_Error_-_Robot_is_not_stopping,_forcing_a_stop&amp;diff=32635"/>
		<updated>2013-12-07T07:03:04Z</updated>

		<summary type="html">&lt;p&gt;Lavenderwong: New thread: Running Error - Robot is not stopping, forcing a stop&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;When I start the battlefield,my robot and other enemy are frozen. The println messages are not displayed in the robot console. But the command prompt shows the following error. I check that the cause of error is the addition of node in my queue (queue.add(n)). However, this line of code shall be fine i guess. So I would like to ask how to solve this error message?&lt;br /&gt;
(this part of my program is for path finding using bfs)&lt;br /&gt;
&lt;br /&gt;
Thank you.&lt;br /&gt;
&lt;br /&gt;
***** BATTLE 1, ROUND 1 *****&lt;br /&gt;
TURN 1: StudentRobot* (1) hard deadline exceeded - 532809us&lt;br /&gt;
Err&amp;gt; Robot StudentRobot* (1) is not stopping.  Forcing a stop.&lt;br /&gt;
Err&amp;gt; Robot StudentRobot* (2) is not stopping.  Forcing a stop.&lt;br /&gt;
Raw score for 0.0 energy left: 0.0&lt;br /&gt;
Robots escaped: 0&lt;br /&gt;
Enemy destroyed: 0&lt;br /&gt;
Turns past after map reference time: 0&lt;br /&gt;
Turns move partially on black blocks: 0&lt;br /&gt;
Turns soft deadline excceed: 0&lt;br /&gt;
Average computation time per turn: 511706&lt;br /&gt;
Max turn computation time: 532809&lt;br /&gt;
Total bad events counted: 0&lt;br /&gt;
SCORE: 0.0&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
private boolean pathFinding_BFS(Node start, Node end){&lt;br /&gt;
		LinkedList&amp;lt;Node&amp;gt; queue = new LinkedList&amp;lt;Node&amp;gt;();&lt;br /&gt;
		queue.add(start);&lt;br /&gt;
		start.setMarked();&lt;br /&gt;
		while (!queue.isEmpty()){&lt;br /&gt;
			Node temp = (Node)queue.poll();&lt;br /&gt;
			System.out.println(&amp;quot;first node:&amp;quot; + temp.getPointInPath().getX() + &amp;quot; y &amp;quot; + temp.getPointInPath().getY());&lt;br /&gt;
			if (temp.equals(end)){&lt;br /&gt;
				temp.setPrevNodeInPath(temp.getPrevNodeInPath());&lt;br /&gt;
				return true;&lt;br /&gt;
			}else{&lt;br /&gt;
				for (Node n : temp.getAdjacentNode()){	&lt;br /&gt;
					System.out.println(&amp;quot;in node:&amp;quot; + n.getPointInPath().getX() + &amp;quot; y &amp;quot; + n.getPointInPath().getY());&lt;br /&gt;
					if (!n.isMarked()){&lt;br /&gt;
						n.setMarked();&lt;br /&gt;
						n.setPrevNodeInPath(temp);&lt;br /&gt;
						System.out.println(&amp;quot;test n&amp;quot;);&lt;br /&gt;
						queue.add(n);  //problem here&lt;br /&gt;
					}&lt;br /&gt;
				}&lt;br /&gt;
			}&lt;br /&gt;
						&lt;br /&gt;
		}&lt;br /&gt;
		return false;&lt;br /&gt;
	}&lt;br /&gt;
	&lt;br /&gt;
	public  List&amp;lt;Point&amp;gt; getShortestPath(Point start){&lt;br /&gt;
		Node src = new Node(start);&lt;br /&gt;
		List&amp;lt;Point&amp;gt; path = new ArrayList&amp;lt;Point&amp;gt;();&lt;br /&gt;
		for (int i=0;i&amp;lt;endup.size();i++){&lt;br /&gt;
			Node destination = new Node(endup.get(i));&lt;br /&gt;
			if (pathFinding_BFS(src, destination)){&lt;br /&gt;
				while (destination.getPrevNodeInPath() != null){&lt;br /&gt;
					destination = destination.getPrevNodeInPath();&lt;br /&gt;
					path.add(destination.getPointInPath());&lt;br /&gt;
				}&lt;br /&gt;
				Collections.reverse(path);&lt;br /&gt;
				return path;&lt;br /&gt;
			}&lt;br /&gt;
&lt;br /&gt;
		}&lt;br /&gt;
		return path;&lt;br /&gt;
	}&lt;/div&gt;</summary>
		<author><name>Lavenderwong</name></author>
		
	</entry>
</feed>