diff --git a/src/pathfinder/npf/queue.cpp b/src/pathfinder/npf/queue.cpp
index 960cda8e5c..a6a920a009 100644
--- a/src/pathfinder/npf/queue.cpp
+++ b/src/pathfinder/npf/queue.cpp
@@ -84,11 +84,11 @@ void BinaryHeap::Free(bool free_values)
 bool BinaryHeap::Push(void *item, int priority)
 {
 	if (this->size == this->max_size) return false;
-	assert(this->size < this->max_size);
+	dbg_assert(this->size < this->max_size);
 
 	if (this->elements[this->size >> BINARY_HEAP_BLOCKSIZE_BITS] == nullptr) {
 		/* The currently allocated blocks are full, allocate a new one */
-		assert((this->size & BINARY_HEAP_BLOCKSIZE_MASK) == 0);
+		dbg_assert((this->size & BINARY_HEAP_BLOCKSIZE_MASK) == 0);
 		this->elements[this->size >> BINARY_HEAP_BLOCKSIZE_BITS] = MallocT<BinaryHeapNode>(BINARY_HEAP_BLOCKSIZE);
 		this->blocks++;
 	}
diff --git a/src/pathfinder/npf/queue.h b/src/pathfinder/npf/queue.h
index c65131aec9..738d9d9a11 100644
--- a/src/pathfinder/npf/queue.h
+++ b/src/pathfinder/npf/queue.h
@@ -43,7 +43,7 @@ struct BinaryHeap {
 	 */
 	inline BinaryHeapNode &GetElement(uint i)
 	{
-		assert(i > 0);
+		dbg_assert(i > 0);
 		return this->elements[(i - 1) >> BINARY_HEAP_BLOCKSIZE_BITS][(i - 1) & BINARY_HEAP_BLOCKSIZE_MASK];
 	}